A successive relaxation algorithm to solve a MILP involving piecewise linear functions with application to road design
From MaRDI portal
Publication:2114828
DOI10.1007/s10589-021-00347-7zbMath1487.90488OpenAlexW4220869055MaRDI QIDQ2114828
Dominique Monnet, Warren L. Hare, Yves Lucet
Publication date: 15 March 2022
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-021-00347-7
Applications of mathematical programming (90C90) Mixed integer programming (90C11) Linear programming (90C05)
Uses Software
Cites Work
- Unnamed Item
- Optimizing horizontal alignment of roads in a specified corridor
- Models and algorithms to improve earthwork operations in road design using mixed integer linear programming
- A note on: spline technique for modeling roadway profile to minimize earthwork cost
- Linear programming model for finding optimal roadway grades that minimize earthwork cost
- Models and strategies for efficiently determining an optimal vertical alignment of roads
- Fast feasibility check of the multi-material vertical alignment problem in road design
- Spline technique for modeling roadway profile to minimize earthwork cost
- A mixed-integer linear programming model to optimize the vertical alignment considering blocks and side-slopes in road construction
- On the Solution of Discrete Programming Problems
- On the Significance of Solving Linear Programming Problems with Some Integer Variables
- A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization
- A Suggested Extension of Special Ordered Sets to Non-Separable Non-Convex Programming Problems
- Benchmarking optimization software with performance profiles.
This page was built for publication: A successive relaxation algorithm to solve a MILP involving piecewise linear functions with application to road design
