Lower bounds and algorithms for the 2-dimensional vector packing problem
From MaRDI portal
Publication:5939229
DOI10.1016/S0166-218X(00)00267-5zbMath0996.68245MaRDI QIDQ5939229
Publication date: 4 November 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items
Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty, Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows, Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem, A single machine scheduling problem with two-dimensional vector packing constraints, An optimization-based heuristic for the machine reassignment problem, Fast machine reassignment, Vector bin packing with heterogeneous bins: application to the machine reassignment problem, Bin packing and related problems: general arc-flow formulation with graph compression, Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing, Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem, Resource allocation algorithms for virtualized service hosting platforms, Stabilized branch-and-price algorithms for vector packing problems, Properties of some ILP formulations of a class of partitioning problems, A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function, An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing, Solving bin packing problems using VRPSolver models, Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups, Using VRPSolver to efficiently solve the \textsc{differential harvest problem}, A generic exact solver for vehicle routing and related problems, A branch-and-price algorithm for the two-dimensional vector packing problem, A branch-and-price algorithm for the temporal bin packing problem, A two-dimensional vector packing model for the efficient use of coil cassettes, Compact integer linear programming formulations for the temporal bin packing problem with fire-ups, An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs, Dual Inequalities for Stabilized Column Generation Revisited, A Comparative Study of Multi-objective Evolutionary Algorithms for the Bi-objective 2-Dimensional Vector Packing Problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- There is no asymptotic PTAS for two-dimensional vector packing
- Lower bounds and reduction procedures for the bin packing problem
- Bin packing can be solved within 1+epsilon in linear time
- The ellipsoid method and its consequences in combinatorial optimization
- Resource constrained scheduling as generalized bin packing
- Properties of some ILP formulations of a class of partitioning problems
- Worst-case analyses, linear programming and the bin-packing problem
- A branch-and-bound algorithm for the two-dimensional vector packing problem
- Solving binary cutting stock problems by column generation and branch- and-bound
- Multiple-type, two-dimensional bin packing problems: Applications and algorithms
- Branch-and-price algorithms for the one-dimensional cutting stock problem
- An improved lower bound for the bin packing problem
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- A Linear Programming Approach to the Cutting-Stock Problem
- Bithreshold Graphs
- New Algorithms for Bin Packing
- An algorithm for a class of loading problems
- Exact Solution of Cutting Stock Problems Using Column Generation and Branch-and-Bound
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- The Loading Problem
