Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem
Author:
- 1 February 2013
- journal article
- research article
- Published by Springer Nature in Journal of Global Optimization
- Vol. 55 (3) , 491-506
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- New Branch-and-Cut Algorithm for Bilevel Linear ProgrammingJournal of Optimization Theory and Applications, 2007
- MIPLIB 2003Operations Research Letters, 2006
- Portfolio-Based Electricity Generation Planning: Policy Implications For Renewables And Energy SecurityMitigation and Adaptation Strategies for Global Change, 2006
- The inverse optimal value problemMathematical Programming, 2004
- An Inverse-Optimization-Based Auction Mechanism to Support a Multiattribute RFQ ProcessManagement Science, 2003
- Inverse OptimizationOperations Research, 2001
- Minimal-revenue congestion pricing Part II: An efficient algorithm for the general caseTransportation Research Part B: Methodological, 2000
- Minimal-revenue congestion pricing part I: A fast algorithm for the single-origin caseTransportation Research Part B: Methodological, 1999
- On an instance of the inverse shortest paths problemMathematical Programming, 1992
- Computational Difficulties of Bilevel Linear ProgrammingOperations Research, 1990