A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows
From MaRDI portal
Publication:3141769
DOI10.1002/net.3230230706zbMath0792.90084OpenAlexW2040886899MaRDI QIDQ3141769
Sylvie Gélinas, Jacques Desrosiers, André Langevin, François Soumis, Martin Desrochers
Publication date: 1 November 1993
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230230706
Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10)
Related Items
Decision making algorithm for a class of two‐level manufacturing systems, A branch-and-cut framework for the consistent traveling salesman problem, An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size, Solving the multi-vehicle multi-covering tour problem, Visual attractiveness in vehicle routing via bi-objective optimization, Exact and anytime approach for solving the time dependent traveling salesman problem with time windows, Solving the single crane scheduling problem at rail transshipment yards, A general variable neighborhood search for the traveling salesman problem with time windows under various objectives, Integrating driver behavior into last-mile delivery routing: combining machine learning and optimization in a hybrid decision support framework, A general VNS heuristic for the traveling salesman problem with time windows, The delivery man problem with time windows, Improved Peel-and-Bound: Methods for Generating Dual Bounds with Multivalued Decision Diagrams, A variable iterated greedy algorithm for the traveling salesman problem with time windows, Perspectives on integer programming for time-dependent models, Scheduling tasks on moving executors to minimise the maximum lateness, New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times, Beam-ACO for the travelling salesman problem with time windows, A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows, New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows, Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the travelling salesman problem with time windows, Single-vehicle scheduling with time window constraints, On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem, Unconstrained binary models of the travelling salesman problem variants for quantum optimization, Projection results for vehicle routing, Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version, Improving the filtering of branch-and-bound MDD solver
