Pages that link to "Item:Q1771223"
From MaRDI portal
The following pages link to A practical algorithm for computing a subadditive dual function for set partitioning (Q1771223):
Displaying 6 items.
- Solving the \(p\)-median problem with a semi-Lagrangian relaxation (Q853887) (← links)
- On a class of subadditive duals for the uncapacitated facility location problem (Q902981) (← links)
- A dual ascent procedure for the set partitioning problem (Q955334) (← links)
- Non-linear anonymous pricing combinatorial auctions (Q1042137) (← links)
- A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints (Q2010923) (← links)
- Subadditive approaches in integer programming (Q2371344) (← links)