Pages that link to "Item:Q652705"
From MaRDI portal
The following pages link to Heuristic algorithms for the inverse mixed integer linear programming problem (Q652705):
Displaying 9 items.
- Heuristic approaches for biobjective mixed 0-1 integer linear programming problems (Q319659) (← links)
- Inverse linear programming with interval coefficients (Q495129) (← links)
- A polyhedral characterization of the inverse-feasible region of a mixed-integer program (Q1785436) (← links)
- Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem (Q1945502) (← links)
- Capacitated partial inverse maximum spanning tree under the weighted Hamming distance (Q2279743) (← links)
- An empirical evaluation of walk-and-round heuristics for mixed integer linear programs (Q2393650) (← links)
- Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography (Q5014642) (← links)
- Inverse Mixed Integer Optimization: Polyhedral Insights and Trust Region Methods (Q5087718) (← links)
- Objective Selection for Cancer Treatment: An Inverse Optimization Approach (Q5095171) (← links)