Repairing MIP infeasibility through local branching (Q2459381): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2006.08.004 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: FEASPUMP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MIPLIB2003 / 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 / 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.2006.08.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2130289059 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local branching / 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: Pivot and shift -- a mixed integer programming heuristic / 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: A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: General purpose heuristics for integer programming. I / 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: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search and local branching / 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: Q2753185 / 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: The feasibility pump / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum feasible subsystem problem, IISs and IIS-hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Heuristics for the Maximum Feasible Subsystem Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying Minimally Infeasible Subsystems of Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the feasibility pump / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2006.08.004 / rank
 
Normal rank

Latest revision as of 18:47, 18 December 2024

scientific article
Language Label Description Also known as
English
Repairing MIP infeasibility through local branching
scientific article

    Statements

    Repairing MIP infeasibility through local branching (English)
    0 references
    0 references
    0 references
    6 November 2007
    0 references
    mixed-integer programs
    0 references
    heuristics
    0 references
    feasible solutions
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers