Pages that link to "Item:Q5955558"

The following pages link to New classes of fast lower bounds for bin packing problems (Q5955558):

Displaying 50 items.

• Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem (Q297181) (← links)
• A branch-price-and-cut method for the vegetable crop rotation scheduling problem with minimal plot sizes (Q319637) (← 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)
• An effective tabu search approach with improved loading algorithms for the 3L-CVRP (Q337416) (← links)
• Unsplittable non-additive capacitated network design using set functions polyhedra (Q342169) (← links)
• Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing (Q342540) (← links)
• On the extremality of maximal dual feasible functions (Q433834) (← links)
• The three-dimensional knapsack problem with balancing constraints (Q440966) (← links)
• Using dual feasible functions to construct fast lower bounds for routing and location problems (Q499343) (← links)
• Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem (Q531429) (← links)
• A new destructive bounding scheme for the bin packing problem (Q610978) (← links)
• A survey of dual-feasible and superadditive functions (Q610986) (← links)
• The off-line group seat reservation problem (Q613435) (← links)
• A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem (Q632643) (← links)
• New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation (Q868985) (← links)
• Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem (Q882647) (← links)
• New bin packing fast lower bounds (Q883309) (← links)
• Theoretical investigations on maximal dual feasible functions (Q974987) (← links)
• New lower bounds for bin packing problems with conflicts (Q976310) (← links)
• Bidimensional packing by bilinear programming (Q1016113) (← links)
• New lower bounds based on column generation and constraint programming for the pattern minimization problem (Q1025240) (← links)
• Balancing assembly lines with variable parallel workplaces: problem definition and effective solution procedure (Q1042153) (← links)
• On the two-dimensional knapsack problem (Q1433651) (← links)
• A DSS based on optimizer tools and MTS meta-heuristic for the warehousing problem with conflicts (Q1708260) (← links)
• A branch, bound, and remember algorithm for the simple disassembly line balancing problem (Q1722962) (← links)
• LP bounds in various constraint programming approaches for orthogonal packing (Q1761178) (← links)
• A cutting plane approach for integrated planning and scheduling (Q1761978) (← links)
• Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows (Q1788902) (← links)
• Worst-case analysis of maximal dual feasible functions (Q1926616) (← links)
• Conservative scales in packing problems (Q1944876) (← links)
• Bin packing problem with conflicts and item fragmentation (Q2026980) (← links)
• Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
• Solving bin packing problems using VRPSolver models (Q2033390) (← links)
• Lower bounds for three-dimensional multiple-bin-size bin packing problems (Q2260892) (← links)
• Deterministic model for customized pilot manufacture production with various backplane sizes (Q2310672) (← links)
• A three-dimensional bin-packing model: exact multicriteria solution and computational complexity (Q2404356) (← links)
• Solving the one-dimensional bin packing problem with a weight annealing heuristic (Q2468485) (← links)
• A generic view of Dantzig--Wolfe decomposition in mixed integer programming (Q2494825) (← links)
• The two-dimensional bin packing problem with variable bin sizes and costs (Q2568334) (← links)
• State-of-the-art exact and heuristic solution procedures for simple assembly line balancing (Q2569059) (← links)
• Fast lifting procedures for the bin packing problem (Q2581316) (← links)
• A new exact method for the two-dimensional orthogonal packing problem (Q2643952) (← links)
• Computing the asymptotic worst-case of bin packing lower bounds (Q2643960) (← links)
• Arc-flow model for the two-dimensional guillotine cutting stock problem (Q2654387) (← links)
• (Q2861521) (← links)
• A branch-and-price-and-cut algorithm for the pattern minimization problem (Q3163667) (← links)
• Online Square Packing (Q3183464) (← links)
• A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem (Q4553880) (← links)
• Hybrid greedy heuristics based on linear programming for the three‐dimensional single bin‐size bin packing problem (Q4979988) (← links)