Pages that link to "Item:Q610986"
From MaRDI portal
The following pages link to A survey of dual-feasible and superadditive functions (Q610986):
Displaying 14 items.
- Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem (Q297181) (← links)
- Procedures for the bin packing problem with precedence constraints (Q322561) (← links)
- Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
- Skewed general variable neighborhood search for the location routing scheduling problem (Q337608) (← links)
- Unsplittable non-additive capacitated network design using set functions polyhedra (Q342169) (← links)
- Lower and upper bounds for the bin packing problem with fragile objects (Q406499) (← links)
- On the extremality of maximal dual feasible functions (Q433834) (← links)
- Using dual feasible functions to construct fast lower bounds for routing and location problems (Q499343) (← links)
- Multi-dimensional bin packing problems with guillotine constraints (Q976021) (← links)
- New lower bounds based on column generation and constraint programming for the pattern minimization problem (Q1025240) (← links)
- Exact algorithms for the bin packing problem with fragile objects (Q1662100) (← links)
- Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems (Q1694814) (← links)
- LP bounds in various constraint programming approaches for orthogonal packing (Q1761178) (← links)
- Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation (Q5962716) (← links)
