Pages that link to "Item:Q1016113"

The following pages link to Bidimensional packing by bilinear programming (Q1016113):

Displaying 17 items.

• Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
• Using dual feasible functions to construct fast lower bounds for routing and location problems (Q499343) (← links)
• Degeneracy removal in cutting plane methods for disjoint bilinear programming (Q519763) (← links)
• A survey of dual-feasible and superadditive functions (Q610986) (← links)
• Routing problems with loading constraints (Q610992) (← links)
• The minimum raster set problem and its application to the \(d\)-dimensional orthogonal packing problem (Q724050) (← links)
• The value of integrating loading and routing (Q1752774) (← links)
• Time-optimal velocity planning by a bound-tightening technique (Q1753068) (← links)
• Conservative scales in packing problems (Q1944876) (← links)
• Global optimization problems and domain reduction strategies (Q1960192) (← links)
• Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
• Friendly bin packing instances without integer round-up property (Q2340275) (← links)
• (Q2861507) (← links)
• Combinatorial Benders' Cuts for the Strip Packing Problem (Q2935306) (← links)
• A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem (Q4553880) (← links)
• Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem (Q5085469) (← links)
• Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction (Q5348475) (← links)