Bicriterion discrete equilibrium network design problem

DOI10.1002/NET.21546MaRDI QIDQ4642480zbMATH OpenOpenAlexFDO

Authors Chi Xie

Publication date 23 May 2018

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.21546

zbMATH Keywords

biobjective optimizationdichotomic methoddiscrete network designequilibrium network designgeneralized Benders decomposition

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Recommendations

• scientific article; zbMATH DE number 3845309
• Bicriteria network flow problems: Continuous case
• scientific article; zbMATH DE number 1090065
• The non-approximability of bicriteria network design problems
• A branch and bound algorithm for bi-level discrete network design problem
• Computing and Combinatorics
• Bicriteria network flow problems: Integer case
• Solving nonlinear bilevel programming models of the equilibrium network design problem: A comparative review

Cited in

(5)

• The non-approximability of bicriteria network design problems
• A branch and bound algorithm for bi-level discrete network design problem
• A modified active set algorithm for transportation discrete network design bi-level problem
• A Dantzig-Wolfe decomposition based heuristic scheme for bi-level dynamic network design problem
• The Pareto-optimal solution set of the equilibrium network design problem with multiple commensurate objectives

This page was built for publication: Bicriterion discrete equilibrium network design problem

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