Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem
From MaRDI portal
Publication:1945502
DOI10.1007/s10898-013-0036-3zbMath1267.90080OpenAlexW1980114777MaRDI QIDQ1945502
Publication date: 8 April 2013
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-013-0036-3
branch-and-boundinverse optimizationlinear program with complementarity constraintspartial inverse mixed integer linear programming
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Heuristic algorithms for the inverse mixed integer linear programming problem
- Oligopoly models for market price of electricity under demand uncertainty and unit reliability
- Cutting plane algorithms for the inverse mixed integer linear programming problem
- On an instance of the inverse shortest paths problem
- The inverse optimal value problem
- Inverse conic programming with applications
- Two general methods for inverse optimization problems
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Discrete linear bilevel programming problem
- MIPLIB 2003
- New branch-and-Cut algorithm for bilevel linear programming
- Complexity of Partial Inverse Assignment Problem and Partial Inverse Cut Problem
- An Inverse-Optimization-Based Auction Mechanism to Support a Multiattribute RFQ Process
- Computational Difficulties of Bilevel Linear Programming
- On the Global Solution of Linear Programs with Linear Complementarity Constraints
- Inverse Optimization
- New Branch-and-Bound Rules for Linear Bilevel Programming
- Algorithmic Applications in Management
This page was built for publication: Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem
