scientific article; zbMATH DE number 870411

Publication date: 24 April 1996

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

heuristics branch-and-cut algorithm on-line optimization time windows asymmetric traveling salesman problem flexible manufacturing sequential ordering problem asymmetric Hamiltonian path problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items

Longest fault-free paths in hypercubes with vertex faults, A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem, \((2n-3)\)-fault-tolerant Hamiltonian connectivity of augmented cubes \(AQ_n\), Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges, A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem, An improved ant colony system for the sequential ordering problem, Load-dependent and precedence-based models for pickup and delivery problems, Paint batching problem on \(M\)-to-1 conveyor systems, Conditional edge-fault Hamiltonian-connectivity of restricted hypercube-like networks, Coupling ant colony systems with strong local searches, A hybrid particle swarm optimization approach for the sequential ordering problem, Solving the single crane scheduling problem at rail transshipment yards, Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs, The delivery man problem with time windows, A heuristic manipulation technique for the sequential ordering problem, Solving the Hamiltonian path problem with a light-based computer, Improved Peel-and-Bound: Methods for Generating Dual Bounds with Multivalued Decision Diagrams, Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches, Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes, Vertex-pancyclicity of twisted cubes with maximal faulty edges, New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP, Fault-free Hamiltonian cycles in twisted cubes with conditional link faults, Bounding, filtering and diversification in CP-based local branching, Projected Chvátal-Gomory cuts for mixed integer linear programs, Fault-tolerant Hamiltonian laceability of balanced hypercubes, 1-vertex-fault-tolerant cycles embedding on folded hypercubes, Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults, Beam-ACO for the travelling salesman problem with time windows, Online-optimization of multi-elevator transport systems with reoptimization algorithms based on set-partitioning models, An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs, Every edge lies on cycles embedding in folded hypercubes with both vertex and edge faults, Fault-tolerant embedding of pairwise independent Hamiltonian paths on a faulty hypercube with edge faults, Fault-free longest paths in star networks with conditional link faults, A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows, Hamiltonian connectivity of the WK-recursive network with faulty nodes, Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs, Unconstrained binary models of the travelling salesman problem variants for quantum optimization, Every edge lies on cycles embedding in folded hypercubes with vertex-fault-tolerant, Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version, On mathematical programming with indicator constraints, A tabu search algorithm for scheduling a single robot in a job-shop environment, Improving the filtering of branch-and-bound MDD solver

Uses Software

TSPLIB