Pages that link to "Item:Q5013588"
From MaRDI portal
The following pages link to On the Complexity of Inverse Mixed Integer Linear Optimization (Q5013588):
Displaying 4 items.
- Feasibility in reverse convex mixed-integer programming (Q439456) (← links)
- A polyhedral characterization of the inverse-feasible region of a mixed-integer program (Q1785436) (← links)
- Decomposition and Adaptive Sampling for Data-Driven Inverse Linear Optimization (Q5058012) (← links)
- A new mixed integer programming approach for inverse correspondence analysis (Q6068705) (← links)