The following pages link to Inverse maximum capacity problems (Q1387947):
Displaying 15 items.
- An inverse maximum capacity path problem with lower bound constraints (Q698900) (← links)
- Partial inverse min-max spanning tree problem (Q830941) (← links)
- Inverse constrained bottleneck problems under weighted \(l_{\infty}\) norm (Q883285) (← links)
- A further study on inverse linear programming problems (Q1298792) (← links)
- Weight reduction problems with certain bottleneck objectives. (Q1417504) (← links)
- Inverse problems of submodular functions on digraphs (Q1573989) (← links)
- Some reverse location problems (Q1576337) (← links)
- Input estimation and identification of extra inputs in inverse DEA models (Q1888560) (← links)
- An inverse DEA model for inputs/outputs estimate (Q1969901) (← links)
- Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes (Q2385479) (← links)
- Minimax inverse problems of minimum cuts (Q2782726) (← links)
- Constrained and bicriteria inverse bottleneck optimization problems under weighted Hamming distance (Q3225072) (← links)
- An Oracle Strongly Polynomial Algorithm for Bottleneck Expansion Problems (Q4806342) (← links)
- The optimization of road building schedule based on budget restriction (Q4932891) (← links)
- A class of bottleneck expansion problems (Q5936134) (← links)
