Results 21 to 30 of about 232 (135)
Efficiently solvable special cases of bottleneck travelling salesman problems
Discrete Applied Mathematics, 1991 A special case of the bottleneck travelling salesman problem is investigated. For distance matrices that are circulant matrices, it is shown that the problem can be solved in \(O(n \log n)\) time in contrast with the sum version of the problem for which this is still an open question.
Rainer E. Burkard, W. Sandholzer
openaire +1 more source
Fifty years of scheduling: a survey of milestones [PDF]
, 2009 Scheduling has become a major field within operational research with several hundred publications appearing each year. This paper explores the historical development of the subject since the mid 1950s when the landmark publications started to appear.
Strusevich, Vitaly A. +5 more
core +1 more source
Quantum Heuristic Approach to Vehicle Routing Problem
MathematicsQuantum optimization has recently drawn considerable attention as one of the possible applications of noisy intermediate-scale quantum computation, yet the problem of qubit requirement remains a major bottleneck when combinatorial optimization problems ...
Jun Suk Kim +2 more
doaj +1 more source
Minimization of passive motion time in laser microvia drilling of ABF dielectrics
Научно-технический вестник информационных технологий, механики и оптикиPrinted Circuit Board manufacturing is a key sector of modern electronics industry where improving the throughput of microvia drilling operations is of paramount importance. One effective solution is maskless laser technology which provides high accuracy
A. V. Voronov +2 more
doaj +1 more source
Advanced Electronic Materials, EarlyView.Ising machines are emerging as specialized hardware solvers for computationally hard optimization problems. This review examines five major platforms—digital CMOS, analog CMOS, emerging devices, coherent optics, and quantum systems—highlighting physics‐rooted advantages and shared bottlenecks in scalability and connectivity.
Hyunjun Lee, Joon Pyo Kim, Sanghyeon Kim
wiley +1 more source
Business Strategy and the Environment, EarlyView.ABSTRACT This study demonstrates how a profitable, lean, and environmentally responsible e‐waste reverse logistics system can be designed using integrated Operations Research (OR) techniques. Addressing the growing urgency of responsible consumption (UN SDG 12) and the projected rise of the e‐waste sector to USD 137.60 billion by 2029, the research ...
Sheeba Pathak, Hajar Fatorachian
wiley +1 more source
Persistency in the Traveling Salesman Problem on Halin graphs
, 2000 For the Traveling Salesman Problem (TSP) on Halin graphs with three types of cost functions: sum, bottleneck and balanced and with arbitrary real edge costs we compute in polynomial time the persistency partition $E_{All}$, $E_{Some}$, $E_{None}$ of the ...
Lacko, Vladimír
core +1 more source
Scalable Computation of Topological Abstractions for Scalar Data
Computer Graphics Forum, EarlyView.Abstract Topological data analysis has become an important tool for large scale scalar data analysis and visualization, efficiently extracting the inherent structure and features of interest of the data. However, with growing dataset sizes and complexity, it is increasingly becoming infeasible to compute topological abstractions of interest in serial ...
M. Will +6 more
wiley +1 more source
Insertion Heuristics for Central Cycle Problems [PDF]
, 2006 A central cycle problem requires a cycle that is reasonably short and keeps a the maximum distance from any node not on the cycle to its nearest node on the cycle reasonably low.
Lamb, John Douglas
core
Ordered Median Traveling Salesman Problem
Networks, Volume 88, Issue 1, Page 59-84, July 2026.ABSTRACT This paper introduces a novel combinatorial optimization problem with ordering constraints, termed the Ordered Median Traveling Salesman Problem (OMTSP). The OMTSP integrates key elements from both the classic Traveling Salesman Problem (TSP) and the Ordered Median Location Problem.
Ivana Ljubić +3 more
wiley +1 more source