Pages that link to "Item:Q1029667"
From MaRDI portal
The following pages link to Constrained inverse min-max spanning tree problems under the weighted Hamming distance (Q1029667):
Displayed 12 items.
- The inverse parallel machine scheduling problem with minimum total completion time (Q380601) (← links)
- Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm (Q486731) (← links)
- Inverse max+sum spanning tree problem under weighted \(l_1\) norm by modifying the sum-cost vector (Q723499) (← links)
- Inverse minimum cost flow problems under the weighted Hamming distance (Q992575) (← links)
- Upgrading min-max spanning tree problem under various cost functions (Q1680539) (← links)
- Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector (Q1685587) (← links)
- On inverse linear programming problems under the bottleneck-type weighted Hamming distance (Q1707916) (← links)
- Weighted inverse maximum perfect matching problems under the Hamming distance (Q1945512) (← links)
- Inverse minimum flow problem under the weighted sum-type Hamming distance (Q2012059) (← links)
- Approximation algorithms for capacitated partial inverse maximum spanning tree problem (Q2176281) (← links)
- Capacitated partial inverse maximum spanning tree under the weighted Hamming distance (Q2279743) (← links)
- Constrained and bicriteria inverse bottleneck optimization problems under weighted Hamming distance (Q3225072) (← links)