Bidimensional packing by bilinear programming
From MaRDI portal
Publication:1016113
DOI10.1007/s10107-007-0184-7zbMath1169.90428OpenAlexW2160430945MaRDI QIDQ1016113
Alberto Caprara, Michele Monaci
Publication date: 4 May 2009
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-007-0184-7
Related Items
Bin packing and cutting stock problems: mathematical models and exact algorithms, A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem, Combinatorial Benders' Cuts for the Strip Packing Problem, Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem, A survey of dual-feasible and superadditive functions, Routing problems with loading constraints, Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction, Conservative scales in packing problems, Global optimization problems and domain reduction strategies, Using dual feasible functions to construct fast lower bounds for routing and location problems, Degeneracy removal in cutting plane methods for disjoint bilinear programming, The value of integrating loading and routing, Time-optimal velocity planning by a bound-tightening technique, Unnamed Item, Exact solution techniques for two-dimensional cutting and packing, The minimum raster set problem and its application to the \(d\)-dimensional orthogonal packing problem, Friendly bin packing instances without integer round-up property
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An on-line algorithm for multidimensional bin packing
- A general framework for bounds for higher-dimensional orthogonal packing problems.
- Lower bounds and reduction procedures for the bin packing problem
- The modified integer round-up property of the one-dimensional cutting stock problem
- Bin packing can be solved within 1+epsilon in linear time
- The ellipsoid method and its consequences in combinatorial optimization
- Generalized bilinear programming. I: Models, applications and linear programming relaxation
- Worst-case analyses, linear programming and the bin-packing problem
- New bounds for multidimensional packing
- The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case
- The two-dimensional finite bin packing problem. II: New lower and upper bounds
- On the two-dimensional knapsack problem
- A symmetrical linear maxmin approach to disjoint bilinear programming
- Global optimization problems and domain reduction strategies
- Exact Solution of the Two-Dimensional Finite Bin Packing Problem
- A Set-Covering-Based Heuristic Approach for Bin-Packing Problems
- Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- Bidimensional Packing by Bilinear Programming
- Solving Large-Scale Zero-One Linear Programming Problems
- Two-Dimensional Finite Bin-Packing Algorithms
- A simple on-line bin-packing algorithm
- A pseudopolynomial network flow formulation for exact knapsack separation
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- On Finitely Terminating Branch-and-Bound Algorithms for Some Global Optimization Problems
- The Three-Dimensional Bin Packing Problem
- On Linear Characterizations of Combinatorial Optimization Problems
- A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems
- Multistage Cutting Stock Problems of Two and More Dimensions
- A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
- Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing
- Concavity cuts for disjoint bilinear programming
- New classes of fast lower bounds for bin packing problems
