Pages that link to "Item:Q2010918"
From MaRDI portal
The following pages link to Combinatorial optimization with interaction costs: complexity and solvable cases (Q2010918):
Displaying 9 items.
- Treatment of combinatorial optimization problems using selection equations with cost terms. II: NP-hard three-dimensional assignment problems (Q1808370) (← links)
- Treatment of combinatorial optimization problems using selection equations with cost terms. I: Two-dimensional assignment problems (Q1808371) (← links)
- The linearization problem of a binary quadratic problem and its applications (Q2070726) (← links)
- Two-stage robust optimization problems with two-stage uncertainty (Q2140314) (← links)
- Matroid bases with cardinality constraints on the intersection (Q2149563) (← links)
- The quadratic cycle cover problem: special cases and efficient bounds (Q2175054) (← links)
- Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems (Q2329727) (← links)
- On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty (Q2664004) (← links)
- Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications (Q5918723) (← links)