Branch-and-price-and-cut for a service network design and hub location problem
From MaRDI portal
Publication:1752143
DOI10.1016/j.ejor.2016.05.058zbMath1394.90161OpenAlexW2223796397MaRDI QIDQ1752143
Michael Drexl, Stefan Irnich, Ann-Kathrin Rothenbächer
Publication date: 24 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://download.uni-mainz.de/RePEc/pdf/Discussion_Paper_1506.pdf
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)
Related Items
A stochastic programming model for a tactical solid waste management problem, Near real-time loadplan adjustments for less-than-truckload carriers, Identifying the market areas of port-centric logistics and hinterland intermodal transportation, An exact column-generation approach for the lot-type design problem, Perspectives on modeling hub location problems, Modeling congestion and service time in hub location problems
Cites Work
- Multimodal freight transportation planning: a literature review
- Implementation of a three-stage approach for the dynamic resource-constrained shortest-path sub-problem in branch-and-price
- Hub location-allocation in intermodal logistic networks
- The convex hull of two core capacitated network design problems
- Hub location for time definite transportation
- Service network design with management and coordination of multiple fleets
- Planning models for freight transportation
- Integer programming formulations of discrete hub location problems
- Service network design in freight transportation
- On splittable and unsplittable flow capacitated network design arc-set polyhedra.
- General network design: a unified view of combined location and network design problems
- A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations
- Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
- Service network design for freight transportation: a review
- Network hub location problems: The state of the art
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- The hub location and network design problem with fixed and variable arc costs: formulation and dual-based solution heuristic
- Shortest chain subject to side constraints
- Network Design Using Cut Inequalities
- Minimizing greenhouse gas emissions in intermodal freight transport: an application to rail service design
- Column Generation
- Selected Topics in Column Generation
- Shortest Path Problems with Resource Constraints
