Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem
From MaRDI portal
Recommendations
- Stronger multi-commodity flow formulations of the capacitated vehicle routing problem
- Approximation algorithms for the capacitated multi-item lot-sizing problem via flow-cover inequalities
- Strong Formulations for Multi-Item Capacitated Lot Sizing
- Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities
- Approximation and Online Algorithms
- On methods for the convex multi-commodity flow problem
- Strong multi-commodity flow formulations for the asymmetric traveling salesman problem
- Relaxation methods for the strictly convex multicommodity flow problem with capacity constraints on individual commodities
- Special class of flowshop sequencing problems
- A multi-commodity flow formulation for the generalized pooling problem
Cites work
- scientific article; zbMATH DE number 3156381 (Why is no real title available?)
- scientific article; zbMATH DE number 3354799 (Why is no real title available?)
- A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing)
- A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships
- A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints
- A result on projection for the vehicle routing problem
- An inexact algorithm for the sequential ordering problem
- Exact And Heuristic Procedures For The Traveling Salesman Problem With Precedence Constraints, Based On Dynamic Programming
- Load-dependent and precedence-based models for pickup and delivery problems
- Maximal Flow Through a Network
- New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP
- On extended formulations for the precedence constrained asymmetric traveling salesman problem
- Projection results for vehicle routing
- Quasi-semi-metrics, oriented multi-cuts and related polyhedra
- Stronger multi-commodity flow formulations of the capacitated vehicle routing problem
- The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
- The precedence-constrained asymmetric traveling salesman polytope
Cited in
(11)- Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization
- Pickup and delivery problem with incompatibility constraints
- An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP
- Exact algorithms for the multi-pickup and delivery problem with time windows
- Stronger multi-commodity flow formulations of the capacitated vehicle routing problem
- scientific article; zbMATH DE number 2159167 (Why is no real title available?)
- Formulations for the clustered traveling salesman problem with \(d\)-relaxed priority rule
- The multi-pickup and delivery problem with time windows
- An exact dynamic programming algorithm for the precedence-constrained class sequencing problem
- A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships
- Strong cuts from compatibility relations for the dial-a-ride problem
This page was built for publication: Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q322625)
