Heuristic algorithms for the inverse mixed integer linear programming problem
From MaRDI portal
Publication:652705
DOI10.1007/S10898-010-9637-2zbMath1229.90105OpenAlexW2086250564MaRDI QIDQ652705
Publication date: 15 December 2011
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-010-9637-2
Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (8)
Inverse Mixed Integer Optimization: Polyhedral Insights and Trust Region Methods ⋮ Objective Selection for Cancer Treatment: An Inverse Optimization Approach ⋮ Objective-based counterfactual explanations for linear discrete optimization ⋮ Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem ⋮ Inverse linear programming with interval coefficients ⋮ A polyhedral characterization of the inverse-feasible region of a mixed-integer program ⋮ Capacitated partial inverse maximum spanning tree under the weighted Hamming distance ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
Uses Software
Cites Work
- Cutting plane algorithms for the inverse mixed integer linear programming problem
- On an instance of the inverse shortest paths problem
- Inverse optimization in high-speed networks
- Two general methods for inverse optimization problems
- The complexity analysis of the inverse center location problem
- Inverse combinatorial optimization: a survey on problems, methods, and results
- MIPLIB 2003
- Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance
- An Inverse-Optimization-Based Auction Mechanism to Support a Multiattribute RFQ Process
- Inverse Optimization
- Inverse Optimization: An Application to the Capacitated Plant Location Problem
- A column generation method for inverse shortest path problems
- Unnamed Item
- Unnamed Item
This page was built for publication: Heuristic algorithms for the inverse mixed integer linear programming problem