Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups
type: Item
instance of: scholarly article
title: Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups
zbMATH Open document ID: 1503.90118
author: J. Martinovic
author: Nico Strasdat
author: Fabio Furini
author: José Valério de Carvalho
published in: Optimization Letters
publication date: 2022-10-11T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 7599791
zbMATH Keywords: cutting and packing
zbMATH Keywords: temporal bin packing problem
zbMATH Keywords: fire-ups
zbMATH Keywords: integer linear programming
MaRDI profile type: Publication
full work available at URL: s11590-021-01825-x
OpenAlex ID: W4200474271
cites work: Scheduling jobs with fixed start and end times
cites work: Multi-objective temporal bin packing problem: an application in cloud computing
cites work: The Temporal Knapsack Problem and Its Solution
cites work: Solving the temporal knapsack problem via recursive Dantzig-Wolfe reformulation
cites work: Lower bounds and algorithms for the 2-dimensional vector packing problem
cites work: An iterative dynamic programming approach for the temporal knapsack problem
cites work: A branch-and-price algorithm for the temporal bin packing problem
cites work: Bin packing and cutting stock problems: mathematical models and exact algorithms
cites work: Exact solution techniques for two-dimensional cutting and packing
cites work: Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
cites work: An exact approach to the strip-packing problem
cites work: Compact integer linear programming formulations for the temporal bin packing problem with fire-ups
cites work: Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods
cites work: A branch-and-bound algorithm for the two-dimensional vector packing problem
cites work: LP models for bin packing and cutting stock problems
cites work: Uncapacitated Lot-Sizing Problems with Start-Up Costs
DOI: 10.1007/S11590-021-01825-X
Recommended article: Compact integer linear programming formulations for the temporal bin packing problem with fire-ups
Recommended article: A combinatorial flow-based formulation for temporal bin packing problems
Recommended article: A branch-and-price algorithm for the temporal bin packing problem
Recommended article: Solving the variable size bin packing problem with discretized formulations
Recommended article: Tight approximations for resource constrained scheduling and bin packing
Recommended article: Bin Packing Problem with Time Lags
Recommended article: Relaxations and exact solution of the variable sized bin packing problem
Recommended article: A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint
description: scientific article; zbMATH DE number 7599791