Inverse of the Gomory corner relaxation of integer programs
From MaRDI portal
Cites work
- A fast algorithm for computing the Smith normal form with multipliers for a nonsingular integer matrix
- A further study on inverse linear programming problems
- A polyhedral characterization of the inverse-feasible region of a mixed-integer program
- Algorithmic Applications in Management
- An inverse problem of the weighted shortest path problem
- Binary clutter inequalities for integer programs
- Calculating some inverse linear programming problems
- Comparison of Some Algorithms for Solving the Group Theoretic Integer Programming Problem
- Corner polyhedra and their connection with cutting planes
- Cutting plane algorithms for the inverse mixed integer linear programming problem
- Data-driven estimation in equilibrium using inverse optimization
- Dynamic Programming Algorithms for the Integer Programming Problem—I: The Integer Programming Problem Viewed as a Knapsack Type Problem
- Extended formulations for Gomory corner polyhedra
- Generalized inverse multiobjective optimization with application to cancer therapy
- Gomory integer programs
- Heuristic algorithms for the inverse mixed integer linear programming problem
- How tight is the corner relaxation?
- Inverse integer programming
- Inverse Mixed Integer Optimization: Polyhedral Insights and Trust Region Methods
- Inverse Optimization
- Inverse Problem Theory and Methods for Model Parameter Estimation
- Inverse problems in biomedical imaging: modeling and methods of solution
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
- Network flows. Theory, algorithms, and applications.
- Objective selection for cancer treatment: an inverse optimization approach
- On an instance of the inverse shortest paths problem
- On efficient sparse integer matrix Smith normal form computations
- On the structure of the inverse-feasible region of a linear program
- Some polyhedra related to combinatorial problems
- Technical Note—Recognizing Unbounded Integer Programs
- The group-theoretic approach in mixed integer programming
This page was built for publication: Inverse of the Gomory corner relaxation of integer programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7310979)
