Bidimensional packing by bilinear programming (Q1016113): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10107-007-0184-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2160430945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concavity cuts for disjoint bilinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized bilinear programming. I: Models, applications and linear programming relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finitely Terminating Branch-and-Bound Algorithms for Some Global Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A symmetrical linear maxmin approach to disjoint bilinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Dimensional Finite Bin-Packing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case / rank
 
Normal rank
Property / cites work
 
Property / cites work: The two-dimensional finite bin packing problem. II: New lower and upper bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: A pseudopolynomial network flow formulation for exact knapsack separation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization problems and domain reduction strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bidimensional Packing by Bilinear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the two-dimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case analyses, linear programming and the bin-packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Large-Scale Zero-One Linear Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An on-line algorithm for multidimensional bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New classes of fast lower bounds for bin packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general framework for bounds for higher-dimensional orthogonal packing problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for Higher-Dimensional Orthogonal Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing can be solved within 1+epsilon in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4833806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multistage Cutting Stock Problems of Two and More Dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Linear Characterizations of Combinatorial Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple on-line bin-packing algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Three-Dimensional Bin Packing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds and reduction procedures for the bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Solution of the Two-Dimensional Finite Bin Packing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Set-Covering-Based Heuristic Approach for Bin-Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4858956 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The modified integer round-up property of the one-dimensional cutting stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds for multidimensional packing / rank
 
Normal rank

Latest revision as of 13:31, 1 July 2024

scientific article
Language Label Description Also known as
English
Bidimensional packing by bilinear programming
scientific article

    Statements

    Bidimensional packing by bilinear programming (English)
    0 references
    0 references
    0 references
    4 May 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references