Compact integer linear programming formulations for the temporal bin packing problem with fire-ups (Q2668727): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2021.105288 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3139099132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs with fixed start and end times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-objective temporal bin packing problem: an application in cloud computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalized bin packing problem for parcel delivery in last-mile logistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Temporal Knapsack Problem and Its Solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting / rank
 
Normal rank
Property / cites work
 
Property / cites work: New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing and related problems: general arc-flow formulation with graph compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the temporal knapsack problem via recursive Dantzig-Wolfe reformulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds and algorithms for the 2-dimensional vector packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3347319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Benders' Cuts for the Strip Packing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logistics capacity planning: a stochastic bin packing formulation and a progressive hedging meta-heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Stochastic Model for Estimating the Power Consumption of a Processor / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-price algorithm for the temporal bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing and cutting stock problems: mathematical models and exact algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Programming Approach to the Cutting-Stock Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual Inequalities for Stabilized Column Generation Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stabilized branch-and-price algorithms for vector packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Methods of Organizing and Planning Production / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for the two-dimensional strip packing problem with and without rotations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-dimensional packing problems: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Approach to the Strip-Packing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound algorithm for the two-dimensional vector packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution of bin-packing problems using column generation and branch-and-bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: LP models for bin packing and cutting stock problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Extra Dual Cuts to Accelerate Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large-scale unit commitment under uncertainty: an updated literature survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-price algorithms for the one-dimensional cutting stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving binary cutting stock problems by column generation and branch- and-bound / rank
 
Normal rank

Latest revision as of 06:11, 28 July 2024

scientific article
Language Label Description Also known as
English
Compact integer linear programming formulations for the temporal bin packing problem with fire-ups
scientific article

    Statements

    Compact integer linear programming formulations for the temporal bin packing problem with fire-ups (English)
    0 references
    0 references
    0 references
    0 references
    7 March 2022
    0 references
    0 references
    cutting and packing
    0 references
    temporal bin packing problem
    0 references
    fire-ups
    0 references
    integer programming
    0 references
    reduction methods
    0 references
    0 references
    0 references
    0 references