Inverse Mixed Integer Optimization: Polyhedral Insights and Trust Region Methods
From MaRDI portal
Publication:5087718
DOI10.1287/IJOC.2021.1138OpenAlexW3122987013MaRDI QIDQ5087718FDOQ5087718
Authors: Merve Bodur, Timothy C. Y. Chan, Ian Yihang Zhu 
Publication date: 1 July 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.00301
Recommendations
- On the complexity of inverse mixed integer linear optimization
- Cutting plane algorithms for the inverse mixed integer linear programming problem
- Inverse integer optimization with an imperfect observation
- A polyhedral characterization of the inverse-feasible region of a mixed-integer program
- Inverse integer optimization with multiple observations
mixed integer programminginverse optimizationcutting planes algorithmsdecomposition methods \(\bullet{}\) bilevel optimization
Cites Work
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
- Decomposition algorithms for stochastic programming on a computational grid
- Inverse combinatorial optimization: a survey on problems, methods, and results
- A computational study of a solver system for processing two-stage stochastic LPs with enhanced Benders decomposition
- Tri-criterion inverse portfolio optimization with application to socially responsible mutual funds
- Inverse Optimization
- On an instance of the inverse shortest paths problem
- Calculating some inverse linear programming problems
- Capacity inverse minimum cost flow problem
- Heuristic algorithms for the inverse mixed integer linear programming problem
- An exact algorithm for the network pricing problem
- Network design and allocation mechanisms for carrier alliances in liner shipping
- Inverse optimization for linearly constrained convex separable programming problems
- A polyhedral characterization of the inverse-feasible region of a mixed-integer program
- Inverse conic programming with applications
- A perturbation approach for an inverse quadratic programming problem
- Inverse integer programming
- Data-driven inverse optimization with imperfect information
- Cutting plane algorithms for the inverse mixed integer linear programming problem
- Generalized inverse multiobjective optimization with application to cancer therapy
- Behavioral Estimation of Mathematical Programming Objective Function Coefficients
- Inverse optimization: a new perspective on the Black-Litterman model
- Inverse optimization with noisy data
- Data-driven estimation in equilibrium using inverse optimization
- The Benders decomposition algorithm: a literature review
- Inverse optimization for the recovery of constraint parameters
- Inverse optimization for multi-objective linear programming
- Inverse optimization for the recovery of market structure from market outcomes: an application to the MISO electricity market
- Revenue optimization in energy networks involving self-scheduled demand and a smart grid
- Pricing and revenue maximization over a multicommodity transportation network: the nonlinear demand case
- An inverse optimization approach for a capacitated vehicle routing problem
Cited In (6)
- A trust-region-based derivative free algorithm for mixed integer programming
- Clustering integrated fusion model based on the maximum matching problem
- Objective-based counterfactual explanations for linear discrete optimization
- A new mixed integer programming approach for inverse correspondence analysis
- Inverse optimization of integer programming games for parameter estimation arising from competitive retail location selection
- A polyhedral characterization of the inverse-feasible region of a mixed-integer program
Uses Software
This page was built for publication: Inverse Mixed Integer Optimization: Polyhedral Insights and Trust Region Methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5087718)
