Pages that link to "Item:Q1824560"
From MaRDI portal
The following pages link to Multi-constrained matroidal knapsack problems (Q1824560):
Displaying 16 items.
- The matroidal knapsack: A class of (often) well-solvable problems (Q797497) (← links)
- New polynomial bounds for matroidal knapsacks (Q1278377) (← links)
- Matroidal relaxations for 0-1 knapsack problems (Q1319682) (← links)
- Probabilistic properties of the dual structure of the multidimensional knapsack problem and fast statistically efficient algorithms (Q1338142) (← links)
- Linear-time algorithms for parametric minimum spanning tree problems on planar graphs (Q1391297) (← links)
- Decomposable multi-parameter matroid optimization problems. (Q1401298) (← links)
- In memoriam Paolo M. Camerini (Q1803668) (← links)
- Note on combinatorial optimization with max-linear objective functions (Q1803670) (← links)
- Stochastic on-line knapsack problems (Q1804369) (← links)
- On the supermodular knapsack problem (Q1824552) (← links)
- A multiply constrained matroid optimization problem (Q1825757) (← links)
- Knapsack Cover Subject to a Matroid Constraint (Q2963920) (← links)
- Minmax linear knapsack problem with grouped variables and gub (Q3835625) (← links)
- Using sparsification for parametric minimum spanning tree problems (Q5054811) (← links)
- Linear-time algorithms for parametric minimum spanning tree problems on planar graphs (Q5096337) (← links)
- Mathematical programming formulations for the collapsed k-core problem (Q6168587) (← links)