0-1 reformulations of the multicommodity capacitated network design problem
From MaRDI portal
Publication:1025989
DOI10.1016/j.dam.2008.04.022zbMath1168.90002OpenAlexW2150123606WikidataQ118165487 ScholiaQ118165487MaRDI QIDQ1025989
Bernard Gendron, Antonio Frangioni
Publication date: 23 June 2009
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2008.04.022
column generationvalid inequalitiesreformulationcutting-plane methodmulticommodity capacitated network design
Related Items
Integrated model for timetabling and circulation planning on an urban rail transit line: a coupled network-based flow formulation, Exact approaches to the single-source network loading problem, Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem, Unsplittable non-additive capacitated network design using set functions polyhedra, Discretized formulations for capacitated location problems with modular distribution costs, A stabilized structured Dantzig-Wolfe decomposition method, Single Allocation Hub Location with Heterogeneous Economies of Scale, Affine recourse for the robust network design problem: Between static and dynamic routing, General network design: a unified view of combined location and network design problems, A note on ``A LP-based heuristic for a time-constrained routing problem, Revisiting Lagrangian relaxation for network design, Affine routing for robust network design, Enhancing discretized formulations: the knapsack reformulation and the star reformulation, Benders decomposition and column-and-row generation for solving large-scale linear programs with column-dependent-rows, Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows, Column generation for extended formulations, Liner shipping service scheduling and cargo allocation, Accelerated multigrid for graph Laplacian operators, Models and heuristics for the k ‐degree constrained minimum spanning tree problem with node‐degree costs, On the approximability of robust network design, A MIP-based approach to solve the prize-collecting local access network design problem, Efficient metaheuristics to solve the intermodal terminal location problem, A new extended formulation of the generalized assignment problem and some associated valid inequalities, Unnamed Item, Prize collecting Steiner trees with node degree dependent costs, Algorithms for the one-dimensional two-stage cutting stock problem, Modeling and solving a multimodal transportation problem with flexible-time and scheduled services, On the problem of minimizing the cost with optical devices in Wavelength Division Multiplexing optical networks: complexity analysis, mathematical formulation and improved heuristics, Comments on: ``Static and dynamic source locations in undirected networks, Column Generation for Extended Formulations, Multilevel Approaches for the Critical Node Problem, A fuzzy programming method for modeling demand uncertainty in the capacitated road-rail multimodal routing problem with time windows, Primal convergence from dual subgradient methods for convex optimization, The minimum flow cost Hamiltonian cycle problem: a comparison of formulations
Cites Work
- Unnamed Item
- Unnamed Item
- Benders, metric and cutset inequalities for multicommodity capacitated network design
- The convex hull of two core capacitated network design problems
- Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
- About Lagrangian methods in integer optimization
- Source sink flows with capacity installation in batches
- Exact solution of bin-packing problems using column generation and branch-and-bound
- Minimum cost capacity installation for multicommodity network flows
- Exact solution of multicommodity network optimization problems with general step cost functions
- Models for representing piecewise linear cost functions
- Projections of the capacitated network loading problem
- Service network design in freight transportation
- Planning models for long-haul operations of postal and express shipment companies
- Row and column generation technique for a multistage cutting stock problem
- On splittable and unsplittable flow capacitated network design arc-set polyhedra.
- A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design
- Computational experience with a difficult mixed-integer multicommodity flow problem
- A branch-and-cut algorithm for capacitated network design problems
- LP models for bin packing and cutting stock problems
- Diversification strategies in local search for a nonbifurcated network loading problem
- On capacitated network design cut-set polyhedra
- Solving a network design problem
- A LP-based heuristic for a time-constrained routing problem
- A proximal trust-region algorithm for column generation stabilization
- Solving the Capacitated Local Access Network Design Problem
- A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs
- Multicommodity network design with discrete node costs
- Network design arc set with variable upper bounds
- Design of Capacitated Multicommodity Networks with Multiple Facilities
- Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design
- Networks synthesis and optimum network design problems: Models, solution methods and applications
- A composite algorithm for a concave-cost network flow problem
- An Algorithm for Large Zero-One Knapsack Problems
- Subgradient Methods for the Service Network Design Problem
- A Simplex-Based Tabu Search Method for Capacitated Network Design
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
- Generalized Bundle Methods
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
- Network Design Using Cut Inequalities
- Routing in Point-to-Point Delivery Systems: Formulations and Solution Heuristics
- Shortest paths, single origin‐destination network design, and associated polyhedra
- Algorithms – ESA 2005
- Capacitated Network Design—Polyhedral Structure and Computation
- Tabu search for a network loading problem with multiple facilities
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
