A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates (Q1754152): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q262241
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2017.10.046 / rank
Normal rank
 
Property / author
 
Property / author: Sergey Polyakovskiy / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ILOG SCHEDULE / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2604124474 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1703.07244 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual-feasible functions for integer programming and combinatorial optimization. Basics, extensions and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analytical model for the container loading problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new constraint programming approach for the orthogonal packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new lower bound for the non-oriented two-dimensional bin-packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the non-oriented two-dimensional bin packing problem / 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: One-dimensional heuristics adapted for two-dimensional rectangular strip packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An annotated bibliography of combined routing and loading problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New approximability results for two-dimensional bin packing / 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: Multi-job Cutting Stock Problem with Due Dates and Release Dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3059312 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent advances on two-dimensional bin packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The one-dimensional cutting stock problem with due dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial Benders' decomposition for the lock scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Failure-Directed Search for Constraint-Based Scheduling / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2017.10.046 / rank
 
Normal rank

Latest revision as of 08:23, 11 December 2024

scientific article
Language Label Description Also known as
English
A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates
scientific article

    Statements

    A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates (English)
    0 references
    0 references
    0 references
    30 May 2018
    0 references
    cutting
    0 references
    two-dimensional bin packing
    0 references
    batch scheduling
    0 references
    packing heuristic
    0 references
    lookahead search
    0 references

    Identifiers