Mathematical programming based heuristics for the 0--1 MIP: a survey (Q2401328): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Octane / 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/s10732-017-9336-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2616528159 / 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: A note on the pivot and complement heuristic for 0-1 programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the feasibility pump / rank
 
Normal rank
Property / cites work
 
Property / cites work: SCIP: solving constraint integer 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: Octane: A New Heuristic for Pure 0–1 Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pivot and shift -- a mixed integer programming heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean heuristics for location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A feasibility pump heuristic for general mixed-integer problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving zero-one mixed integer programming problems using tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Software for Convex Mixed Integer Nonlinear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approach to Zero-One Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring relaxation induced neighborhoods to improve MIP solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Repairing MIP infeasibility through local branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximity search for 0--1 mixed-integer convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The feasibility pump / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Linear Programming and Integer Feasibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Future paths for integer programming and links to artificial intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scatter search and star-paths: Beyond the genetic metaphor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Thresholding: Improved Search by Nonmonotonic Trajectories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5692642 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric tabu-search for mixed integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: General purpose heuristics for integer programming. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: A user's guide to tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restrict-and-relax search for 0-1 mixed-integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved convergent heuristics for the 0-1 multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable Neighbourhood Pump Heuristic for 0-1 Mixed Integer Programming Feasibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2861506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search and local branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search: basics and variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian relaxation-based heuristic for the vehicle routing with full container load / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search within a pivot and complement framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Production Planning by Mixed Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Traveling salesman problem heuristics: leading methods, implementations and latest advances / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational study of parametric tabu search for 0-1 mixed integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic Ceiling Point Algorithm for General Integer Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-one programming with many variables and few constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for multi-attribute vehicle routing problems: a survey and synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: New convergent heuristics for 0-1 mixed integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem / rank
 
Normal rank

Latest revision as of 09:37, 14 July 2024

scientific article
Language Label Description Also known as
English
Mathematical programming based heuristics for the 0--1 MIP: a survey
scientific article

    Statements

    Mathematical programming based heuristics for the 0--1 MIP: a survey (English)
    0 references
    0 references
    0 references
    8 September 2017
    0 references
    0 references
    mathematical programming
    0 references
    heuristics
    0 references
    metaheuristics
    0 references
    0--1 mixed integer program
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references