New lower bounds based on column generation and constraint programming for the pattern minimization problem (Q1025240): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CUTGEN1 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
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.1016/j.cor.2009.01.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2074077571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting stock with no three parts per pattern: work-in-process and pattern minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-price-and-cut algorithm for the pattern minimization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simulated annealing heuristic for the one-dimensional cutting stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of dual-feasible and superadditive functions / 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: New classes of fast lower bounds for bin packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pattern reduction in one-dimensional cutting stock problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem / 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: Controlling Cutting Pattern Changes in One-Dimensional Trim Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pattern minimisation in cutting stock problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint and integer programming. Toward a unified methodology. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding of linear programming in a simulated annealing algorithm for solving a mixed integer production planning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-dimensional cutting stock problem to minimize the number of different patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved typology of cutting and packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid heuristic to reduce the number of different patterns in cutting stock problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:05, 1 July 2024

scientific article
Language Label Description Also known as
English
New lower bounds based on column generation and constraint programming for the pattern minimization problem
scientific article

    Statements

    New lower bounds based on column generation and constraint programming for the pattern minimization problem (English)
    0 references
    0 references
    0 references
    18 June 2009
    0 references
    cutting and packing problems
    0 references
    pattern minimization problem
    0 references
    lower bounds
    0 references
    integer programming
    0 references
    constraint programming
    0 references
    0 references
    0 references
    0 references

    Identifiers