Subjects -> MATHEMATICS (Total: 1074 journals)
    - APPLIED MATHEMATICS (86 journals)
    - GEOMETRY AND TOPOLOGY (23 journals)
    - MATHEMATICS (793 journals)
    - MATHEMATICS (GENERAL) (43 journals)
    - NUMERICAL ANALYSIS (23 journals)
    - PROBABILITIES AND MATH STATISTICS (106 journals)

MATHEMATICS (793 journals)            First | 1 2 3 4     

Showing 401 - 538 of 538 Journals sorted alphabetically
Journal of Dynamics and Differential Equations     Hybrid Journal  
Journal of Engineering Mathematics     Hybrid Journal   (Followers: 2)
Journal of Evolution Equations     Hybrid Journal  
Journal of Experimental Algorithmics     Full-text available via subscription   (Followers: 1)
Journal of Flood Risk Management     Hybrid Journal   (Followers: 12)
Journal of Formalized Reasoning     Open Access   (Followers: 2)
Journal of Function Spaces     Open Access  
Journal of Functional Analysis     Full-text available via subscription   (Followers: 2)
Journal of Geochemical Exploration     Hybrid Journal   (Followers: 1)
Journal of Geological Research     Open Access   (Followers: 1)
Journal of Geovisualization and Spatial Analysis     Hybrid Journal  
Journal of Global Optimization     Hybrid Journal   (Followers: 6)
Journal of Global Research in Mathematical Archives     Open Access   (Followers: 1)
Journal of Group Theory     Hybrid Journal   (Followers: 2)
Journal of Homotopy and Related Structures     Hybrid Journal  
Journal of Honai Math     Open Access  
Journal of Humanistic Mathematics     Open Access   (Followers: 1)
Journal of Hyperbolic Differential Equations     Hybrid Journal  
Journal of Indian Council of Philosophical Research     Hybrid Journal  
Journal of Industrial Mathematics     Open Access   (Followers: 2)
Journal of Inequalities and Applications     Open Access  
Journal of Infrared, Millimeter and Terahertz Waves     Hybrid Journal   (Followers: 2)
Journal of Integrable Systems     Open Access   (Followers: 1)
Journal of K-Theory     Full-text available via subscription  
Journal of Knot Theory and Its Ramifications     Hybrid Journal   (Followers: 1)
Journal of Kufa for Mathematics and Computer     Open Access   (Followers: 1)
Journal of Liquid Chromatography & Related Technologies     Hybrid Journal   (Followers: 7)
Journal of Logical and Algebraic Methods in Programming     Hybrid Journal  
Journal of Manufacturing Systems     Full-text available via subscription   (Followers: 4)
Journal of Mathematical Analysis and Applications     Full-text available via subscription   (Followers: 4)
Journal of mathematical and computational science     Open Access   (Followers: 7)
Journal of Mathematical and Fundamental Sciences     Open Access  
Journal of Mathematical Behavior     Hybrid Journal   (Followers: 2)
Journal of Mathematical Chemistry     Hybrid Journal   (Followers: 3)
Journal of Mathematical Cryptology     Hybrid Journal   (Followers: 1)
Journal of Mathematical Extension     Open Access   (Followers: 3)
Journal of Mathematical Finance     Open Access   (Followers: 7)
Journal of Mathematical Imaging and Vision     Hybrid Journal   (Followers: 6)
Journal of Mathematical Logic     Hybrid Journal   (Followers: 2)
Journal of Mathematical Modelling and Algorithms     Hybrid Journal   (Followers: 1)
Journal of Mathematical Neuroscience     Open Access   (Followers: 9)
Journal of Mathematical Sciences     Hybrid Journal  
Journal of Mathematical Sciences and Applications     Open Access   (Followers: 2)
Journal of Mathematical Sociology     Hybrid Journal   (Followers: 3)
Journal of Mathematics     Open Access  
Journal of Mathematics and Statistics     Open Access   (Followers: 8)
Journal of Mathematics and the Arts     Hybrid Journal   (Followers: 2)
Journal of Mathematics in Industry     Open Access  
Journal of Mathematics Research     Open Access   (Followers: 6)
Journal of Metallurgy     Open Access   (Followers: 7)
Journal of Modern Mathematics Frontier     Open Access  
Journal of Multidisciplinary Modeling and Optimization     Open Access  
Journal of Multivariate Analysis     Hybrid Journal   (Followers: 13)
Journal of Natural Sciences and Mathematics Research     Open Access  
Journal of Nonlinear Analysis and Optimization : Theory & Applications     Open Access   (Followers: 4)
Journal of Nonlinear Mathematical Physics     Hybrid Journal   (Followers: 1)
Journal of Nonlinear Science     Hybrid Journal   (Followers: 1)
Journal of Numerical Cognition     Open Access  
Journal of Numerical Mathematics     Hybrid Journal   (Followers: 2)
Journal of Optimization     Open Access   (Followers: 4)
Journal of Peridynamics and Nonlocal Modeling     Hybrid Journal  
Journal of Problem Solving     Open Access   (Followers: 2)
Journal of Progressive Research in Mathematics     Open Access   (Followers: 1)
Journal of Pseudo-Differential Operators and Applications     Hybrid Journal  
Journal of Pure and Applied Algebra     Full-text available via subscription   (Followers: 4)
Journal of Quantitative Analysis in Sports     Hybrid Journal   (Followers: 8)
Journal of Quantitative Linguistics     Hybrid Journal   (Followers: 6)
Journal of Scientific Computing     Hybrid Journal   (Followers: 18)
Journal of Scientific Research     Open Access  
Journal of Symbolic Computation     Hybrid Journal   (Followers: 1)
Journal of the Australian Mathematical Society     Full-text available via subscription  
Journal of the Egyptian Mathematical Society     Open Access  
Journal of the European Mathematical Society     Full-text available via subscription   (Followers: 1)
Journal of the Indian Mathematical Society     Hybrid Journal   (Followers: 1)
Journal of the Institute of Mathematics of Jussieu     Hybrid Journal  
Journal of the London Mathematical Society     Hybrid Journal   (Followers: 2)
Journal of the Nigerian Mathematical Society     Open Access   (Followers: 1)
Journal of Theoretical and Applied Physics     Open Access   (Followers: 8)
Journal of Topology and Analysis     Hybrid Journal  
Journal of Transport and Supply Chain Management     Open Access   (Followers: 14)
Journal of Turbulence     Hybrid Journal   (Followers: 7)
Journal of Uncertainty Analysis and Applications     Open Access  
Journal of Universal Mathematics     Open Access  
Journal of Urban Regeneration & Renewal     Full-text available via subscription   (Followers: 10)
Journal of Water and Land Development     Open Access   (Followers: 3)
JRAMathEdu : Journal of Research and Advances in Mathematics Education     Open Access   (Followers: 4)
JUMLAHKU : Jurnal Matematika Ilmiah STKIP Muhammadiyah Kuningan     Open Access   (Followers: 1)
JURING (Journal for Research in Mathematics Learning)     Open Access   (Followers: 1)
Jurnal Ilmiah AdMathEdu     Open Access  
Jurnal Matematika     Open Access   (Followers: 1)
Jurnal Matematika Integratif     Open Access  
Jurnal Matematika, Sains, Dan Teknologi     Open Access  
Jurnal Natural     Open Access  
Jurnal Pendidikan Matematika Raflesia     Open Access  
Jurnal Penelitian Pembelajaran Matematika Sekolah     Open Access  
Jurnal Penelitian Sains (JPS)     Open Access  
Jurnal Riset Pendidikan Matematika     Open Access  
Jurnal Sains Matematika dan Statistika     Open Access  
Jurnal Tadris Matematika     Open Access  
Jurnal Teknologi dan Sistem Komputer     Open Access  
Kreano, Jurnal Matematika Kreatif-Inovatif     Open Access   (Followers: 5)
Le Matematiche     Open Access  
Learning and Teaching Mathematics     Full-text available via subscription   (Followers: 7)
Lettera Matematica     Hybrid Journal  
Lietuvos Matematikos Rinkinys     Open Access   (Followers: 1)
Limits : Journal of Mathematics and Its Applications     Open Access   (Followers: 1)
Linear Algebra and its Applications     Full-text available via subscription   (Followers: 23)
Linear and Multilinear Algebra     Hybrid Journal   (Followers: 8)
Lithuanian Mathematical Journal     Hybrid Journal  
LMS Journal of Computation and Mathematics     Free  
Lobachevskii Journal of Mathematics     Open Access  
Logic and Analysis     Hybrid Journal  
Logic Journal of the IGPL     Hybrid Journal  
Logica Universalis     Hybrid Journal  
manuscripta mathematica     Hybrid Journal  
MaPan : Jurnal Matematika dan Pembelajaran     Open Access  
Marine Genomics     Hybrid Journal   (Followers: 2)
Matemáticas, Educación y Sociedad     Open Access  
Matematicheskie Zametki     Full-text available via subscription  
Matematika     Open Access  
Matematychni Studii     Open Access  
Mathematica Eterna     Open Access  
Mathematica Scandinavica     Open Access   (Followers: 1)
Mathematica Slovaca     Hybrid Journal   (Followers: 1)
Mathematical and Computational Forestry & Natural-Resource Sciences     Free  
Mathematical Communications     Open Access  
Mathematical Computation     Open Access   (Followers: 1)
Mathematical Geosciences     Hybrid Journal   (Followers: 3)
Mathematical Medicine and Biology: A Journal of the IMA     Hybrid Journal   (Followers: 1)
Mathematical Methods in the Applied Sciences     Hybrid Journal   (Followers: 4)
Mathematical Methods of Statistics     Hybrid Journal   (Followers: 4)
Mathematical Modelling and Analysis     Open Access   (Followers: 1)
Mathematical Modelling in Civil Engineering     Open Access   (Followers: 5)
Mathematical Modelling of Natural Phenomena     Full-text available via subscription   (Followers: 1)
Mathematical Models and Methods in Applied Sciences     Hybrid Journal   (Followers: 2)
Mathematical Notes     Hybrid Journal  
Mathematical Proceedings of the Cambridge Philosophical Society     Full-text available via subscription   (Followers: 1)
Mathematical Programming Computation     Hybrid Journal   (Followers: 3)
Mathematical Sciences     Open Access  
Mathematical Social Sciences     Hybrid Journal   (Followers: 1)
Mathematical Theory and Modeling     Open Access   (Followers: 13)
Mathematical Thinking and Learning     Hybrid Journal   (Followers: 3)
Mathematics and Statistics     Open Access   (Followers: 5)
Mathematics Education Forum Chitwan     Open Access   (Followers: 1)
Mathematics Education Journal     Open Access   (Followers: 1)
Mathematics Education Research Journal     Partially Free   (Followers: 17)
Mathematics in Science and Engineering     Full-text available via subscription  
Mathematics of Control, Signals, and Systems (MCSS)     Hybrid Journal   (Followers: 5)
Mathematics of Quantum and Nano Technologies     Open Access  
Mathématiques et sciences humaines     Open Access   (Followers: 7)
Mathematische Annalen     Hybrid Journal   (Followers: 1)
Mathematische Nachrichten     Hybrid Journal   (Followers: 1)
Mathematische Semesterberichte     Hybrid Journal  
Mathematische Zeitschrift     Hybrid Journal   (Followers: 1)
MATI : Mathematical Aspects of Topological Indeces     Open Access  
MATICS     Open Access   (Followers: 2)
Matrix Science Mathematic     Open Access   (Followers: 1)
Measurement Science Review     Open Access   (Followers: 3)
Mediterranean Journal of Mathematics     Hybrid Journal  
Memetic Computing     Hybrid Journal  
Mendel : Soft Computing Journal     Open Access  
Metaheuristics     Hybrid Journal  
Metals and Materials International     Hybrid Journal  
Metascience     Hybrid Journal   (Followers: 1)
Milan Journal of Mathematics     Hybrid Journal  
Mitteilungen der DMV     Hybrid Journal  
MLQ- Mathematical Logic Quarterly     Hybrid Journal  
Monatshefte fur Mathematik     Hybrid Journal  
Moroccan Journal of Pure and Applied Analysis     Open Access   (Followers: 4)
Moscow University Mathematics Bulletin     Hybrid Journal  
MSOR Connections     Open Access   (Followers: 1)
Multiscale Modeling and Simulation     Hybrid Journal   (Followers: 3)
MUST : Journal of Mathematics Education, Science and Technology     Open Access   (Followers: 1)
Nagoya Mathematical Journal     Hybrid Journal  
Nano Research     Hybrid Journal   (Followers: 3)
Nanotechnologies in Russia     Hybrid Journal   (Followers: 1)
Natural Resource Modeling     Hybrid Journal  
New Mathematics and Natural Computation     Hybrid Journal  
Nonlinear Analysis : Modelling and Control     Open Access   (Followers: 1)
Nonlinear Analysis : Theory, Methods & Applications     Hybrid Journal   (Followers: 1)
Nonlinear Analysis: Hybrid Systems     Hybrid Journal  
Nonlinear Analysis: Real World Applications     Hybrid Journal   (Followers: 2)
Nonlinear Differential Equations and Applications NoDEA     Hybrid Journal  
Nonlinear Engineering     Open Access  
Nonlinear Oscillations     Hybrid Journal   (Followers: 1)
North Carolina Journal of Mathematics and Statistics     Open Access  
North-Holland Mathematical Library     Full-text available via subscription   (Followers: 1)
North-Holland Mathematics Studies     Full-text available via subscription  
North-Holland Series in Applied Mathematics and Mechanics     Full-text available via subscription   (Followers: 1)
Note di Matematica     Open Access  
NTM Zeitschrift für Geschichte der Wissenschaften, Technik und Medizin     Hybrid Journal   (Followers: 4)
Numeracy : Advancing Education in Quantitative Literacy     Open Access  
Numerical Analysis and Applications     Hybrid Journal   (Followers: 1)
Numerical Functional Analysis and Optimization     Hybrid Journal   (Followers: 2)
Numerical Linear Algebra with Applications     Hybrid Journal   (Followers: 7)
Numerical Mathematics : Theory, Methods and Applications     Full-text available via subscription  
Numerische Mathematik     Hybrid Journal  
Open Journal of Discrete Mathematics     Open Access   (Followers: 5)
Open Journal of Modelling and Simulation     Open Access   (Followers: 1)
Open Mathematics     Open Access   (Followers: 1)

  First | 1 2 3 4     

Similar Journals
Journal Cover
Optimization Letters
Journal Prestige (SJR): 0.721
Citation Impact (citeScore): 1
Number of Followers: 2  
 
  Hybrid Journal Hybrid journal (It can contain Open Access articles)
ISSN (Print) 1862-4480 - ISSN (Online) 1862-4472
Published by Springer-Verlag Homepage  [2570 journals]
  • Correction to: Distance between vertices of lattice polytopes
    • Abstract: The erratum mostly concerns Table 4 and Figure 6 where two polytopes were misrepresented in the original version.
      PubDate: 2020-03-01
       
  • Preface: Special issue on distances in optimization and graphs dedicated
           to the memory of Michel Deza
    • PubDate: 2020-03-01
       
  • Representation of the Minkowski metric as a fuzzy set
    • Abstract: Abstract This paper proposes a representation of the family of Minkowski distances using fuzzy sets. The proposed method helps to represent human-like perceptions about distances, which can help decision making in presence of non-probabilistic uncertainties such as imprecision and ambiguity. This way we propose to define a fuzzy set regarding the concept of closeness of two elements/sets measured by a Minkowski metric. Two application examples are presented, solved, and compared to some classical approaches. Finally some concluding remarks are provided and some interpretation issues are explained.
      PubDate: 2020-03-01
       
  • A least-squares approach for discretizable distance geometry problems with
           inexact distances
    • Abstract: Abstract A branch-and-prune (BP) algorithm is presented for the discretizable distance geometry problem in \(\mathbb {R}^K\) with inexact distances. The algorithm consists in a sequential buildup procedure where possible positions for each new point to be localized are computed by using distances to at least K previously placed reference points and solving a system of quadratic equations. Such a system is solved in a least-squares sense, by finding the best positive semidefinite rank K approximation for an induced Gram matrix. When only K references are available, a second candidate position is obtained by reflecting the least-squares solution through the hyperplane defined by the reference points. This leads to a search tree which is explored by BP, where infeasible branches are pruned on the basis of Schoenberg’s theorem. In order to study the influence of the noise level, numerical results on some instances with distances perturbed by a small additive noise are presented.
      PubDate: 2020-03-01
       
  • Chirality in metric spaces
    • Abstract: Abstract A definition of chirality based on group theory is presented. It is shown to be equivalent to the usual one in the case of Euclidean spaces, and it permits to define chirality in metric spaces which are not Euclidean.
      PubDate: 2020-03-01
       
  • A constrained interval approach to the generalized distance geometry
           problem
    • Abstract: Abstract This paper presents a new approach to the generalized distance geometry problem, based on a model that uses constraint interval arithmetic. In addition to theoretical results, we give some computational experiments that illustrate the better performance of the proposed approach, compared to others from the literature.
      PubDate: 2020-03-01
       
  • Distance between vertices of lattice polytopes
    • Abstract: Abstract A lattice (d,k)-polytope is the convex hull of a set of points in dimension d whose coordinates are integers ranging between 0 and k. We consider the largest possible distance \(\delta \)(d,k) between two vertices in the edge-graph of a lattice (d,k)-polytope. We show that \(\delta \)(5,3) and \(\delta \)(3,6) are equal to 10. This substantiates the conjecture whereby \(\delta \)(d,k) is achieved by a Minkowski sum of lattice vectors.
      PubDate: 2020-03-01
       
  • On an SDP relaxation for kissing number
    • Abstract: Abstract We demonstrate that an earlier semidefinite-programming relaxation for the kissing-number problem cannot provide good upper bounds. Furthermore, we show the existence of an optimal solution for this relaxation that cannot be used as a basis for establishing a good lower bound.
      PubDate: 2020-03-01
       
  • An integer programming approach for the search of discretization orders in
           distance geometry problems
    • Abstract: Abstract Discretizable distance geometry problems (DDGPs) constitute a class of graph realization problems where the vertices can be ordered in such a way that the search space of possible positions becomes discrete, usually represented by a binary tree. Finding such vertex orders is an essential step to identify and solve DDGPs. Here we look for discretization orders that minimize an indicator of the size of the search tree. This paper sets the ground for exact solution of the optimal discretization order problem by proposing two integer programming formulations and a constraint generation procedure for an extended formulation. We discuss some theoretical aspects of the problem and numerical experiments on protein-like instances of DDGP are also reported.
      PubDate: 2020-03-01
       
  • Nonlinear mapping and distance geometry
    • Abstract: Abstract Distance Geometry Problem (DGP) and Nonlinear Mapping (NLM) are two well established questions: DGP is about finding a Euclidean realization of an incomplete set of distances in a Euclidean space, whereas Nonlinear Mapping is a weighted Least Square Scaling (LSS) method. We show how all these methods (LSS, NLM, DGP) can be assembled in a common framework, being each identified as an instance of an optimization problem with a choice of a weight matrix. We study the continuity between the solutions (which are point clouds) when the weight matrix varies, and the compactness of the set of solutions (after centering). We finally study a numerical example, showing that solving the optimization problem is far from being simple and that the numerical solution for a given procedure may be trapped in a local minimum.
      PubDate: 2020-03-01
       
  • Perfect elimination orderings for symmetric matrices
    • Abstract: Abstract We introduce a new class of structured symmetric matrices by extending the notion of perfect elimination ordering from graphs to weighted graphs or matrices. This offers a common framework capturing common vertex elimination orderings of monotone families of chordal graphs, Robinsonian matrices and ultrametrics. We give a structural characterization for matrices that admit perfect elimination orderings in terms of forbidden substructures generalizing chordless cycles in graphs.
      PubDate: 2020-03-01
       
  • Modelling and solving the perfect edge domination problem
    • Abstract: Abstract A formulation is proposed for the perfect edge domination problem and some exact algorithms based on it are designed and tested. So far, perfect edge domination has been investigated mostly in computational complexity terms. Indeed, we could find no previous explicit mathematical formulation or exact algorithm for the problem. Furthermore, testing our algorithms also represented a challenge. Standard randomly generated graphs tend to contain a single perfect edge dominating solution, i.e., the trivial one, containing all edges in the graph. Accordingly, some quite elaborated procedures had to be devised to have access to more challenging instances. A total of 736 graphs were thus generated, all of them containing feasible solutions other than the trivial ones. Every graph giving rise to a weighted and a non weighted instance, all instances solved to proven optimality by two of the algorithms tested.
      PubDate: 2020-03-01
       
  • The K -discretization and K -incident graphs for discretizable Distance
           Geometry
    • Abstract: Abstract The Distance Geometry Problem (DGP) is the problem of determining whether a realization for a simple weighted undirected graph \(G=(V,E,d)\) in a given Euclidean space exists so that the distances between pairs of realized vertices u, \(v \in V\) correspond to the weights \(d_{uv}\), for each \(\{u,v\} \in E\). We focus on a special class of DGP instances, referred to as the Discretizable DGP (DDGP), and we introduce the K-discretization and the K-incident graphs for the DDGP class. The K-discretization graph is independent on the vertex order that can be assigned to V, and can be useful for discovering whether one of such orders actually exists so that the DDGP assumptions are satisfied. The use of a given vertex order allows the definition of another important graph, the K-incident graph, which is potentially useful for performing pre-processing analysis on the solution set of DDGP instances.
      PubDate: 2020-03-01
       
  • Hitting time quasi-metric and its forest representation
    • Abstract: Abstract Let \(\widehat{m}_{ij}\) be the hitting (mean first passage) time from state i to state j in an n-state ergodic homogeneous Markov chain with transition matrix T. Let \(\Gamma \) be the weighted digraph whose vertex set coincides with the set of states of the Markov chain and arc weights are equal to the corresponding transition probabilities. It holds that $$\begin{aligned} \widehat{m}_{ij}= q_j^{-1}\cdot {\left\{ \begin{array}{ll} f_{ij},&{}\text {if }\;\; i\ne j,\\ q, &{}\text {if }\;\; i=j, \end{array}\right. } \end{aligned}$$where \(f_{ij}\) is the total weight of 2-tree spanning converging forests in \(\Gamma \) that have one tree containing i and the other tree converging to j, \(q_j\) is the total weight of spanning trees converging to j in \(\Gamma ,\) and \(q=\sum _{j=1}^nq_j\) is the total weight of all spanning trees in \(\Gamma .\) Moreover, \(f_{ij}\) and \(q_j\) can be calculated by an algebraic recurrent procedure. A forest expression for Kemeny’s constant is an immediate consequence of this result. Further, we discuss the properties of the hitting time quasi-metric m on the set of vertices of \(\Gamma \): \(m(i,j)=\widehat{m}_{ij}\), \(i\ne j\), and \(m(i,i)=0\). We also consider a number of other metric structures on the set of graph vertices related to the hitting time quasi-metric m—along with various connections between them. The notions and relationships under study are illustrated by two examples.
      PubDate: 2020-03-01
       
  • An application-based characterization of dynamical distance geometry
           problems
    • Abstract: Abstract The dynamical distance geometry problem (dynDGP) is the problem of finding a realization in a Euclidean space of a weighted undirected graph G representing an animation by relative distances, so that the distances between realized vertices are as close as possible to the edge weights. In the dynDGP, the vertex set of the graph G is the set product of V, representing certain objects, and T, representing time as a sequence of discrete steps. We suppose moreover that distance information is given together with the priority of every distance value. The dynDGP is a special class of the DGP where the dynamics of the problem comes to play an important role. In this work, we propose an application-based characterization of dynDGP instances, where the main criteria are the presence or absence of a skeletal structure, and the rigidity of such a skeletal structure. Examples of considered applications include: multi-robot coordination, crowd simulations, and human motion retargeting.
      PubDate: 2020-03-01
       
  • Generalized cut and metric polytopes of graphs and simplicial complexes
    • Abstract: Abstract The metric polytope \({{\mathrm{METP}}}(K_n)\) of the complete graph on n nodes is defined by the triangle inequalities \(x(i,j)\le x(i,k) + x(k,j)\) and \(x(i,j) + x(j,k) + x(k,i)\le 2\) for all triples i, j, k of \(\{1,\dots ,n\}\). The cut polytope \({{\mathrm{CUTP}}}(K_n)\) is the convex hull of the \(\{0,1\}\) vectors of \({{\mathrm{METP}}}(K_n)\). For a graph G on n vertices the metric polytope \({{\mathrm{METP}}}(G)\) and cut polytope \({{\mathrm{CUTP}}}(G)\) are the projections of \({{\mathrm{METP}}}(K_n)\) and \({{\mathrm{CUTP}}}(K_n)\) on the edge set of G. The facets of the cut polytopes are of special importance in optimization and are studied here in some detail for many simple graphs. Then we define variants \({{\mathrm{QMETP}}}(G)\) for quasi-metrics, i.e. not necessarily symmetric distances and we give an explicit description by inequalities. Finally we generalize distances to m-dimensional area between \(m+1\) points and this defines an hemimetric. In that setting the generalization of the notion of graph is the notion of m-dimensional simplicial complex \({\mathcal {K}}\) for which we define a cone of hemimetric \({{\mathrm{HMET}}}({\mathcal {K}})\).
      PubDate: 2020-03-01
       
  • An IP-based swapping algorithm for the metric dimension and minimal doubly
           resolving set problems in hypercubes
    • Abstract: Abstract We consider the problems of determining the metric dimension and the minimum cardinality of doubly resolving sets in n-cubes. Most heuristics developed for these two NP-hard problems use a function that counts the number of pairs of vertices that are not (doubly) resolved by a given subset of vertices, which requires an exponential number of distance evaluations, with respect to n. We show that it is possible to determine whether a set of vertices (doubly) resolves the n-cube by solving an integer program with O(n) variables and O(n) constraints. We then demonstrate that small resolving and doubly resolving sets can easily be determined by solving a series of such integer programs within a swapping algorithm. Results are given for hypercubes having up to a quarter of a billion vertices, and new upper bounds are reported.
      PubDate: 2020-03-01
       
  • On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in
           n -space: missing proofs
    • Abstract: Abstract We supply proofs for a few key results concerning smoothing square roots and model strengthening for a mixed-integer nonlinear-optimization formulation of the the Euclidean Steiner tree problem.
      PubDate: 2020-03-01
       
  • Finding the Maximum Multi Improvement on neighborhood exploration
    • Abstract: Abstract Neighborhood search techniques are often employed to deal with combinatorial optimization problems. Previous works got good results in applying a novel neighborhood search methodology called Multi Improvement (MI). First and best improvement are classical approaches for neighborhood exploration, while the MI has emerged due to the advance of new parallel computing technologies. The MI formalizes the concept of heuristic and exact exploration of independent moves for a given neighborhood structure, however, the advantages of an application of MI face the difficulty to select a great set of independent moves (which can be performed simultaneously). Most of the existing implementations of MI select these moves through heuristic methods, while others have succeeded in implementing exact dynamic programming approaches. In this paper, we propose a formal description for the Maximum Multi Improvement Problem (MMIP), as a theoretical background for the MI. Moreover, we develop three dynamic programming algorithms for solving the MMIP, given a solution tour for a Traveling Salesman Problem and neighborhood operators 2-Opt, 3-Opt, and OrOpt-k. The analysis suggests the rise of a new open topic focused on developing novel efficient neighborhood searches.
      PubDate: 2020-02-22
       
  • A hybrid method for solving systems of nonsmooth equations with box
           constraints
    • Abstract: Abstract This paper proposes a hybrid method for solving systems of nonsmooth equations with box constraints, which combines the idea of Levenberg–Marquard-like method with the nonmonotone strategy and the smoothing approximation technique. Under mild assumptions, the proposed method is proven to possess global and local superlinear convergence. Preliminary numerical results are reported to show the efficiency of this proposed method in practical computation.
      PubDate: 2020-02-21
       
 
JournalTOCs
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Email: journaltocs@hw.ac.uk
Tel: +00 44 (0)131 4513762
 


Your IP address: 34.226.244.70
 
Home (Search)
API
About JournalTOCs
News (blog, publications)
JournalTOCs on Twitter   JournalTOCs on Facebook

JournalTOCs © 2009-