Pages that link to "Item:Q1808980"
From MaRDI portal
The following pages link to Two general methods for inverse optimization problems (Q1808980):
Displaying 14 items.
- Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm (Q486731) (← links)
- Heuristic algorithms for the inverse mixed integer linear programming problem (Q652705) (← links)
- Cutting plane algorithms for the inverse mixed integer linear programming problem (Q1015310) (← links)
- Inverse problems of submodular functions on digraphs (Q1573989) (← links)
- Some reverse location problems (Q1576337) (← links)
- Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem (Q1945502) (← links)
- Computation of inverse 1-center location problem on the weighted trapezoid graphs (Q2212218) (← links)
- An inverse optimization approach for a capacitated vehicle routing problem (Q2242401) (← links)
- Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes (Q2385479) (← links)
- Inverse multi-objective combinatorial optimization (Q2444572) (← links)
- The inverse \(\{0,1\}\)-knapsack problem: theory, algorithms and computational experiments (Q2445845) (← links)
- Some inverse optimization problems under the Hamming distance (Q2575571) (← links)
- The optimization of road building schedule based on budget restriction (Q4932891) (← links)
- A class of bottleneck expansion problems (Q5936134) (← links)
