An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP
From MaRDI portal
Publication:3386761
DOI10.1287/ijoc.2018.0881OpenAlexW2974438822MaRDI QIDQ3386761
Margarita P. Castro, Andre A. Cire, J. Christopher Beck
Publication date: 7 January 2021
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2018.0881
Related Items (5)
Stochastic decision diagrams ⋮ BDD-based optimization for the quadratic stable set problem ⋮ Exact Approach for Integrated Delivery Optimization of E-Commerce and Online-to-Offline Parcels ⋮ Decision Diagrams for Discrete Optimization: A Survey of Recent Advances ⋮ A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem
- Decision diagrams for optimization
- Load-dependent and precedence-based models for pickup and delivery problems
- The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
- Lagrangian bounds from decision diagrams
- The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
- A dynamic programming based algorithm for the crew scheduling problem.
- A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints
- Solver independent rotating workforce scheduling
- On the strength of time-indexed formulations for the resource-constrained project scheduling problem
- Hybrid optimization methods for time-dependent sequencing problems
- The precedence-constrained asymmetric traveling salesman polytope
- Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care
- A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem
- The dial-a-ride problem: Models and algorithms
- 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
- Integer Programming
- Lagrangian relaxation and enumeration for solving constrained shortest-path problems
- An algorithm for the resource constrained shortest path problem
- An Additive Bounding Procedure for Combinatorial Optimization Problems
- State-space relaxation procedures for the computation of bounds to routing problems
- Generalized Bundle Methods
- The General Pickup and Delivery Problem
- Multivalued Decision Diagrams for Sequencing Problems
- On extended formulations for the precedence constrained asymmetric traveling salesman problem
- The traveling-salesman problem and minimum spanning trees: Part II
This page was built for publication: An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP
