Pages that link to "Item:Q1270767"
From MaRDI portal
The following pages link to Properties of some ILP formulations of a class of partitioning problems (Q1270767):
Displayed 5 items.
- Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem (Q297181) (← links)
- A supernodal formulation of vertex colouring with applications in course timetabling (Q610967) (← links)
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems (Q1580967) (← links)
- A branch-and-cut procedure for the Udine course timetabling problem (Q1761891) (← links)
- Lower bounds and algorithms for the 2-dimensional vector packing problem (Q5939229) (← links)