Exploring relaxation induced neighborhoods to improve MIP solutions (Q1769074): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(12 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Claude le Pape / rank
Normal rank
 
Property / author
 
Property / author: Claude le Pape / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: JOBSHOP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Tabu search / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Octane / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MIPLIB / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Scatter Search / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SALSA / 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.1007/s10107-004-0518-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2004489140 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search for General Zero-One Integer Programs Using the Pivot and Complement Heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Shifting Bottleneck Procedure for Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computational Study of the Job-Shop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Octane: A New Heuristic for Pure 0–1 Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pivot and Complement–A Heuristic for 0-1 Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint-based scheduling: Applying constraint programming to scheduling problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2712822 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SALSA: a language for search algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4667436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior Path Methods for Heuristic Integer Programming Procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2731676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Heuristic Procedures for Integer Linear Programming with an Interior / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search with constraint propagation and conflict-based heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic control of a constraint-based algorithm for the preemptive job-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2731680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382646 / rank
 
Normal rank
Property / cites work
 
Property / cites work: LSSPER: Solving the resource-constrained project scheduling problem with large neighbourhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3357523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3785827 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A solution approach of production planning problems based on compact formulations for single-item lot-sizing models. (Abstract of thesis) / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:54, 7 June 2024

scientific article
Language Label Description Also known as
English
Exploring relaxation induced neighborhoods to improve MIP solutions
scientific article

    Statements

    Exploring relaxation induced neighborhoods to improve MIP solutions (English)
    0 references
    0 references
    0 references
    0 references
    17 March 2005
    0 references
    Mixed integer programming
    0 references
    Heuristics
    0 references
    Local search
    0 references
    Hybrid algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers