On a new class of bilevel programming problems and its use for reformulating mixed integer problems

DOI10.1016/0377-2217(93)E0217-LzbMath0910.90225WikidataQ118165531 ScholiaQ118165531MaRDI QIDQ1388924

Antonio Frangioni

Publication date: 19 April 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

integer programmingnetwork programmingnetwork designminimum cost flow problembilevel linear problemhierarchical two-stage optimization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Deterministic network models in operations research (90B10)

Related Items

On the \(p\)-hub interdiction problem, Beyond canonical dc-optimization: the single reverse polar problem, A decentralized production–distribution scheduling problem: Solution and analysis, A Practical Scheme to Compute the Pessimistic Bilevel Optimization Problem, Multiple allocation hub interdiction and protection problems: model formulations and solution approaches, Reformulations in Mathematical Programming: Definitions and Systematics, A new descent algorithm for solving quadratic bilevel programming problems., Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography

Cites Work

• Unnamed Item
• A parametric algorithm for convex cost network flow and related problems
• An Efficient Point Algorithm for a Linear Two-Stage Optimization Problem
• Analysis of Heuristics for Stochastic Programming: Results for Hierarchical Scheduling Problems
• Computational Difficulties of Bilevel Linear Programming
• On two-level optimization
• Bilinear programming: An exact algorithm