Structure-driven fix-and-propagate heuristics for mixed integer programming (Q2295978): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: IPET / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GitHub / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SCIP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SoPlex / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: FEASPUMP / 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/s12532-019-00159-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2794901481 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict analysis in mixed integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5241193 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the feasibility pump / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rounding and Propagation Heuristics for Mixed Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Presolve Reductions in Mixed Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: MIPLIB 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed Integer Programming: Analyzing 12 Years of Progress / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid primal heuristic for finding feasible solutions to mixed integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict graphs in solving integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The mixed vertex packing problem. / 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: Measuring the impact of primal heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: RENS. The optimal rounding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the Performance of MIP and MINLP Solvers by Integrated Heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rapid Learning for Binary Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Four Good Reasons to Use an Interior Point Solver Within a MIP Solver / rank
 
Normal rank
Property / cites work
 
Property / cites work: A brief history of linear and mixed-integer programming computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2712822 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tree-search algorithm for mixed integer programming problems / 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: Improving the Randomization Step in Feasibility Pump / rank
 
Normal rank
Property / cites work
 
Property / cites work: The feasibility pump / 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: Feasibility pump 2.0 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Integer Programming and Cutting Planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure-driven fix-and-propagate heuristics for mixed integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: DINS, a MIP Improvement Heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive kernel search: a heuristic for solving mixed integer linear programs / 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: Variable neighborhood search and local branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree-two Inequalities, Clique Facets, and Biperfect Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generation of feasible integer solutions on a massively parallel computer using the feasibility pump / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Automatic Method of Solving Discrete Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed Integer Programming Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aggregation and Mixed Integer Rounding to Solve MIPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster integer-feasibility in mixed-integer linear programs by branching to force change / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting and Exploiting Permutation Structures in MIPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preprocessing and Probing Techniques for Mixed Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: ZI round, a MIP rounding heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experiments with conflict analysis in mixed integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4346087 / rank
 
Normal rank

Latest revision as of 19:36, 21 July 2024

scientific article
Language Label Description Also known as
English
Structure-driven fix-and-propagate heuristics for mixed integer programming
scientific article

    Statements

    Structure-driven fix-and-propagate heuristics for mixed integer programming (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 February 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    mixed integer programming
    0 references
    primal heuristics
    0 references
    start heuristics
    0 references
    fix-and-propagate
    0 references
    large neighborhood search
    0 references
    IP
    0 references
    MIP
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references