Pages that link to "Item:Q1001332"
From MaRDI portal
The following pages link to Complementary column generation and bounding approaches for set partitioning formulations (Q1001332):
Displaying 13 items.
- Irregular polyomino tiling via integer programming with application in phased array antenna design (Q288219) (← links)
- All-integer column generation for set partitioning: basic principles and extensions (Q296975) (← links)
- An accelerated branch-and-price algorithm for multiple-runway aircraft sequencing problems (Q319714) (← links)
- Modelling transfer line design problem via a set partitioning problem (Q1758032) (← links)
- An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment (Q1823142) (← links)
- A branch-and-price algorithm for a vehicle routing with demand allocation problem (Q1991157) (← links)
- Estimation of convex supports from noisy measurements (Q2040036) (← links)
- A branch-and-price algorithm for capacitated hypergraph vertex separation (Q2175443) (← links)
- Column-generation based bounds for the homogeneous areas problem (Q2356280) (← links)
- Exact solution methods for a generalized assignment problem with location/allocation considerations (Q2830960) (← links)
- Searching for optimal integer solutions to set partitioning problems using column generation (Q5416769) (← links)
- Columnwise neighborhood search: A novel set partitioning matheuristic and its application to the <scp>VeRoLog</scp> Solver Challenge 2019 (Q6092663) (← links)
- The persistent topology of optimal transport based metric thickenings (Q6131559) (← links)
