A Combined Matheuristic for the Piecewise Linear Multicommodity Network Flow Problem
From MaRDI portal
Publication:4602333
DOI10.1142/S0217595917500336zbMath1382.90021OpenAlexW2770026079MaRDI QIDQ4602333
Publication date: 10 January 2018
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595917500336
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Related Items (1)
Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A capacity scaling heuristic for the multicommodity capacitated network design problem
- An enhanced dynamic slope scaling procedure with tabu scheme for fixed charge network flow problems
- Handbook of transportation science.
- Local branching
- A survey on Benders decomposition applied to fixed-charge network design problems
- A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems
- Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs
- A COMBINED CAPACITY SCALING AND LOCAL BRANCHING APPROACH FOR CAPACITATED MULTI-COMMODITY NETWORK DESIGN PROBLEM
- Networks synthesis and optimum network design problems: Models, solution methods and applications
- Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems
- A dynamic domain contraction algorithm for nonconvex piecewise linear network flow problems
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
This page was built for publication: A Combined Matheuristic for the Piecewise Linear Multicommodity Network Flow Problem
