Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs (Q1695015): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(9 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: iOpt / 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: Localizer / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Gurobi / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: OR-Library / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LocalSolver / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963413474 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1604.08448 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SCIP: solving constraint integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A set‐partitioning‐based exact algorithm for the vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Partitioning: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: The volume algorithm: Producing primal solutions with a subgradient method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-Price: Column Generation for Solving Huge Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Generalized Wedelin Heuristic for Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: LocalSolver 1.x: A black-box local-search solver for 0-1 programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3368659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual ascent procedure for the set partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic Method for the Set Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3500142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian-based heuristic for large-scale set covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint handling in genetic algorithms: the set partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical analysis of data -- an overview: from combinatorial optimization to medical applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Airline Crew Scheduling Problems by Branch-and-Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4365133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Parallel, Linear Programming-based Heuristic for Large-Scale Set Partitioning Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Localizer / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Set Partitioning Approach to the Crew Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Tabu Search Method For The Weighted Constraint Satisfaction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constraint programming framework for local search methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved local search for CP toolkits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clause weighting local search for SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4475684 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for large scale 0-1 integer programming with application to airline crew scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analyses on the 2 and 3-flip neighborhoods for the MAX SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 3-flip neighborhood local search for the set covering problem / rank
 
Normal rank

Latest revision as of 02:46, 15 July 2024

scientific article
Language Label Description Also known as
English
Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs
scientific article

    Statements

    Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs (English)
    0 references
    0 references
    6 February 2018
    0 references
    combinatorial optimization
    0 references
    heuristics
    0 references
    set covering problem
    0 references
    set partitioning problem
    0 references
    local search
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references