A Lagrangian relaxation approach for expansion of a highway network
From MaRDI portal
Publication:512983
DOI10.1007/s10479-014-1682-7zbMath1357.90020OpenAlexW2058469301MaRDI QIDQ512983
Ricardo García-Ródenas, José Luis Espinosa-Aranda, Eusebio Angulo
Publication date: 3 March 2017
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-014-1682-7
Lagrangian relaxationnetwork expansiondemand coveringmulticommodity network designhighway corridor location
Cites Work
- A continuous bi-level model for the expansion of highway networks
- Maximizing trip coverage in the location of a single rapid transit alignment
- An approach for solving a modification of the extended rapid transit network design problem
- An extension to rapid transit network design problem
- Location coverage models with demand originating from nodes and paths: Application to cellular network design
- Location of infrastructure in urban railway networks
- Lagrangean relaxation for the capacitated hub location problem with single assignment
- The maximum covering/shortest path problem: A multiobjective network design and routing formulation
- The hierarchical network design problem
- Reducing the hierarchical network design problem
- Models for multi-path covering problems
- A review of extensive facility location in networks
- The hierarchical network design problem with multiple primary paths
- Applying Lagrangian relaxation to the resolution of two-stage location problems
- A multi-modal approach to the location of a rapid transit line
- General network design: a unified view of combined location and network design problems
- Optimization methods for the planning of rapid transit systems
- Multiobjective transportation network design and routing problems: Taxonomy and annotation
- The Hierarchical Network Design Problem: A New Formulation and Solution Procedures
- Integrating Robust Railway Network Design and Line Planning under Failures
- Locating a transit line using tabu search
- A Simplex-Based Tabu Search Method for Capacitated Network Design
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
- Efficient Algorithms for Solving the Shortest Covering Path Problem
- Minimization of unsmooth functionals
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- A heuristic for the location of a rapid transit line
- Locating stations on rapid transit lines
- A Heuristic Procedure For Path Location With Multisource Demand
This page was built for publication: A Lagrangian relaxation approach for expansion of a highway network
