Pages that link to "Item:Q1598883"
From MaRDI portal
The following pages link to A general model of some inverse combinatorial optimization problems and its solution method under \(\ell_\infty\) norm (Q1598883):
Displaying 15 items.
- Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm (Q486731) (← links)
- Inverse problems and solution methods for a class of nonlinear complementarity problems (Q540647) (← links)
- An inverse model for the most uniform problem (Q924880) (← links)
- Note on inverse problem with \(l_\infty\) objective function (Q1272735) (← links)
- Weighted inverse minimum spanning tree problems under Hamming distance (Q1774530) (← links)
- On inverse traveling salesman problems (Q1936660) (← links)
- General restricted inverse assignment problems under \(l_1\) and \(l_{\infty}\) norms (Q2082216) (← links)
- Inverse max+sum spanning tree problem under weighted \(l_{\infty}\) norm by modifying max-weight vector (Q2089873) (← links)
- An inverse optimization approach for a capacitated vehicle routing problem (Q2242401) (← links)
- Capacity inverse minimum cost flow problem (Q2268762) (← links)
- On the adjustment problem for linear programs (Q2370336) (← links)
- Inverse multi-objective combinatorial optimization (Q2444572) (← links)
- The inverse \(\{0,1\}\)-knapsack problem: theory, algorithms and computational experiments (Q2445845) (← links)
- A class of inverse dominant problems under weighted \(l_{\infty }\) norm and an improved complexity bound for Radzik's algorithm (Q2494305) (← links)
- (Q5009558) (← links)
