A Lagrangian relaxation approach for expansion of a highway network

DOI10.1007/S10479-014-1682-7zbMATH Open1357.90020OpenAlexW2058469301MaRDI QIDQ512983FDOQ512983

Authors: Eusebio Angulo, R. García-Ródenas, José Luis Espinosa-Aranda 

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

Recommendations

• Revisiting Lagrangian relaxation for network design
• Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
• Traffic Optimization Under Route Constraints with Lagrangian Relaxation and Cutting Plane Methods
• A Lagrangian relaxation approach for stochastic network capacity expansion with budget constraints
• A Lagrangian Relaxation Technique for Optimizing Interconnection of Local Area Networks

zbMATH Keywords

Lagrangian relaxationnetwork expansiondemand coveringmulticommodity network designhighway corridor location

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Mixed integer programming (90C11)

Cites Work

• The maximum covering/shortest path problem: A multiobjective network design and routing formulation
• General network design: a unified view of combined location and network design problems
• Optimization methods for the planning of rapid transit systems
• The hierarchical network design problem
• A Simplex-Based Tabu Search Method for Capacitated Network Design
• Efficient Algorithms for Solving the Shortest Covering Path Problem
• Minimization of unsmooth functionals
• A heuristic for the location of a rapid transit line
• Locating stations on rapid transit lines
• An approach for solving a modification of the extended rapid transit network design problem
• Lagrangean relaxation for the capacitated hub location problem with single assignment
• A review of extensive facility location in networks
• A multi-modal approach to the location of a rapid transit line
• Multiobjective transportation network design and routing problems: Taxonomy and annotation
• Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
• An extension to rapid transit network design problem
• A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
• Location coverage models with demand originating from nodes and paths: Application to cellular network design
• Applying Lagrangian relaxation to the resolution of two-stage location problems
• A continuous bi-level model for the expansion of highway networks
• Locating a transit line using tabu search
• Maximizing trip coverage in the location of a single rapid transit alignment
• Location of infrastructure in urban railway networks
• Reducing the hierarchical network design problem
• Models for multi-path covering problems
• The hierarchical network design problem with multiple primary paths
• The Hierarchical Network Design Problem: A New Formulation and Solution Procedures
• Integrating Robust Railway Network Design and Line Planning under Failures
• A Heuristic Procedure For Path Location With Multisource Demand

Cited In (3)

• Traffic Optimization Under Route Constraints with Lagrangian Relaxation and Cutting Plane Methods
• A continuous bi-level model for the expansion of highway networks
• A Lagrangian relaxation approach for stochastic network capacity expansion with budget constraints

This page was built for publication: A Lagrangian relaxation approach for expansion of a highway network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q512983)