Cutting plane algorithms for the inverse mixed integer linear programming problem
From MaRDI portal
Recommendations
- Cutting planes in integer and mixed integer programming
- The mixed cutting plane algorithm for all-integer programming
- A cutting plane algorithm for linear reverse convex programs
- A cutting plane theory for mixed integer optimization
- Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
- A disjunctive cutting plane procedure for general mixed-integer linear programs
- A cutting plane algorithm for solving linear bilevel programs
- Computational Integer Programming and Cutting Planes
- A computational study of the cutting plane tree algorithm for general mixed-integer linear programs
- Cutting planes for integer programs with general integer variables
Cites work
- Algorithmic Applications in Management
- Inverse Optimization
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Inverse conic programming with applications
- MIPLIB 2003
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- On an instance of the inverse shortest paths problem
- Two general methods for inverse optimization problems
Cited in
(31)- Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem
- On the complexity of inverse mixed integer linear optimization
- Face dimensions of general-purpose cutting planes for mixed-integer linear programs
- Heuristic algorithms for the inverse mixed integer linear programming problem
- Inverse multi-objective combinatorial optimization
- Inverse conic linear programs in Banach spaces
- Collaborative emergency berth scheduling based on decentralized decision and price mechanism
- Inverse integer optimization with an imperfect observation
- Quantile inverse optimization: improving stability in inverse linear programming
- Inverse scheduling: Two-machine flow-shop problem
- Objective selection for cancer treatment: an inverse optimization approach
- Inverse integer optimization with multiple observations
- scientific article; zbMATH DE number 3984967 (Why is no real title available?)
- Inverse optimization of integer programming games for parameter estimation arising from competitive retail location selection
- Decomposition and Adaptive Sampling for Data-Driven Inverse Linear Optimization
- Objective-based counterfactual explanations for linear discrete optimization
- Robust inverse optimization
- Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective
- An improved genetic algorithm for single-machine inverse scheduling problem
- Inverse optimization with noisy data
- The inverse \(\{0,1\}\)-knapsack problem: theory, algorithms and computational experiments
- Inverse Mixed Integer Optimization: Polyhedral Insights and Trust Region Methods
- Inverse attribute‐based optimization with an application in assortment optimization
- Data-driven inverse optimization with imperfect information
- Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
- A polyhedral characterization of the inverse-feasible region of a mixed-integer program
- An interior-point algorithm for solving inverse linear optimization problem
- A surrogate cutting plane algorithm for all-integer programming
- Generalized inverse multiobjective optimization with application to cancer therapy
- An interior point cutting plane heuristic for mixed integer programming
- Coordination of manufacturing and engineering activities during product transitions
This page was built for publication: Cutting plane algorithms for the inverse mixed integer linear programming problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1015310)
