Pages that link to "Item:Q917446"

The following pages link to Lower bounds and reduction procedures for the bin packing problem (Q917446):

Displayed 50 items.

• Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) ‎ (← links)
• Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools (Q337131) ‎ (← links)
• A grouping genetic algorithm with controlled gene transmission for the bin packing problem (Q337402) ‎ (← links)
• Unsplittable non-additive capacitated network design using set functions polyhedra (Q342169) ‎ (← links)
• An investigation into two bin packing problems with ordering and orientation implications (Q421577) ‎ (← links)
• A simulated annealing hyper-heuristic methodology for flexible decision support (Q427562) ‎ (← links)
• A particle swarm optimizer for grouping problems (Q497654) ‎ (← links)
• An exact method for the 2D guillotine strip packing problem (Q606187) ‎ (← links)
• Optimal rectangle packing (Q610984) ‎ (← 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)
• Computing redundant resources for the resource constrained project scheduling problem (Q853022) ‎ (← 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)
• A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing (Q1013410) ‎ (← links)
• Bidimensional packing by bilinear programming (Q1016113) ‎ (← links)
• Two heuristics for the one-dimensional bin-packing problem (Q1018262) ‎ (← links)
• Branch-and-bound algorithms for the multi-product assembly line balancing problem (Q1194733) ‎ (← links)
• Auxiliary tool allocation in flexible manufacturing systems (Q1266742) ‎ (← links)
• Properties of some ILP formulations of a class of partitioning problems (Q1270767) ‎ (← links)
• BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem (Q1362971) ‎ (← links)
• On linear lower bounds for the resource constrained project scheduling problem. (Q1399576) ‎ (← links)
• Upper bounds and algorithms for the maximum cardinality bin packing problem. (Q1399594) ‎ (← links)
• Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems (Q1580967) ‎ (← links)
• Improved filtering for the bin-packing with cardinality constraint (Q1617384) ‎ (← links)
• Redundant cumulative constraints to compute preemptive bounds (Q1686060) ‎ (← links)
• A sequential value correction heuristic for a bi-objective two-dimensional bin-packing (Q1742194) ‎ (← links)
• Lower bounds for a bin packing problem with linear usage cost (Q1755229) ‎ (← links)
• Energy efficient spatial TDMA scheduling in wireless networks (Q1761130) ‎ (← links)
• A cutting plane approach for integrated planning and scheduling (Q1761978) ‎ (← links)
• Heuristics and lower bounds for the bin packing problem with conflicts (Q1765544) ‎ (← links)
• An analysis of lower bound procedures for the bin packing problem (Q1886845) ‎ (← links)
• An improved lower bound for the bin packing problem (Q1917305) ‎ (← links)
• Grouping evolution strategies: an effective approach for grouping problems (Q2009978) ‎ (← links)
• New symmetry-less ILP formulation for the classical one dimensional bin-packing problem (Q2019488) ‎ (← links)
• Bin packing problem with conflicts and item fragmentation (Q2026980) ‎ (← links)
• Exact solution techniques for two-dimensional cutting and packing (Q2029021) ‎ (← links)
• A virtual microstructure generator for 3D stone masonry walls (Q2168371) ‎ (← links)
• SALSA: combining branch-and-bound with dynamic programming to smoothen workloads in simple assembly line balancing (Q2242373) ‎ (← links)
• An exact algorithm for the type-constrained and variable sized bin packing problem (Q2267302) ‎ (← links)
• Improved lower bounds for the online bin stretching problem (Q2399609) ‎ (← links)
• A three-dimensional bin-packing model: exact multicriteria solution and computational complexity (Q2404356) ‎ (← links)
• Computing the asymptotic worst-case of bin packing lower bounds (Q2643960) ‎ (← links)
• Reinforcement learning for combinatorial optimization: a survey (Q2669503) ‎ (← links)
• Exact and approximate methods for the score-constrained packing problem (Q2672111) ‎ (← links)
• The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers (Q2691324) ‎ (← links)
• Benders Decomposition for Capacitated Network Design (Q2835663) ‎ (← links)
• Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation (Q5086008) ‎ (← links)
• Fast Approximation Methods for Online Scheduling of Outpatient Procedure Centers (Q5131692) ‎ (← links)