Cutting plane algorithms for the inverse mixed integer linear programming problem
From MaRDI portal
Publication:1015310
DOI10.1016/j.orl.2008.12.001zbMath1159.90466OpenAlexW2039438774MaRDI QIDQ1015310
Publication date: 7 May 2009
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2008.12.001
Related Items (25)
Inverse conic linear programs in Banach spaces ⋮ Collaborative emergency berth scheduling based on decentralized decision and price mechanism ⋮ An interior-point algorithm for solving inverse linear optimization problem ⋮ Decomposition and Adaptive Sampling for Data-Driven Inverse Linear Optimization ⋮ Generalized Inverse Multiobjective Optimization with Application to Cancer Therapy ⋮ Inverse integer optimization with an imperfect observation ⋮ Inverse Mixed Integer Optimization: Polyhedral Insights and Trust Region Methods ⋮ Objective Selection for Cancer Treatment: An Inverse Optimization Approach ⋮ Robust inverse optimization ⋮ Coordination of manufacturing and engineering activities during product transitions ⋮ Objective-based counterfactual explanations for linear discrete optimization ⋮ Inverse attribute‐based optimization with an application in assortment optimization ⋮ Inverse optimization of integer programming games for parameter estimation arising from competitive retail location selection ⋮ Quantile Inverse Optimization: Improving Stability in Inverse Linear Programming ⋮ Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem ⋮ Inverse scheduling: Two-machine flow-shop problem ⋮ Inverse multi-objective combinatorial optimization ⋮ An improved genetic algorithm for single-machine inverse scheduling problem ⋮ The inverse \(\{0,1\}\)-knapsack problem: theory, algorithms and computational experiments ⋮ Heuristic algorithms for the inverse mixed integer linear programming problem ⋮ Data-driven inverse optimization with imperfect information ⋮ A polyhedral characterization of the inverse-feasible region of a mixed-integer program ⋮ Inverse integer optimization with multiple observations ⋮ Inverse Optimization with Noisy Data ⋮ On the Complexity of Inverse Mixed Integer Linear Optimization
Uses Software
Cites Work
- On an instance of the inverse shortest paths problem
- Inverse conic programming with applications
- Two general methods for inverse optimization problems
- Inverse combinatorial optimization: a survey on problems, methods, and results
- MIPLIB 2003
- Inverse Optimization
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Algorithmic Applications in Management
This page was built for publication: Cutting plane algorithms for the inverse mixed integer linear programming problem
