ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design (Q342390): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57705357, #quickstatements; #temporary_batch_1714650839244
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A review of interactive methods for multiobjective integer and mixed-integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Interactive Branch-and-Bound Algorithm for Multiple Criteria Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5692464 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fathoming rules for biobjective mixed integer linear programs: review and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Multiobjective Zero-One Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits / rank
 
Normal rank
Property / cites work
 
Property / cites work: The biobjective travelling purchaser problem / 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: 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: Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-phase Pareto local search for the biobjective traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable and large neighborhood search to solve the multiobjective set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the bi-criterion integer programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3760254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thinning out Steiner trees: a node-based model for uniform edge costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Steiner tree problems in graphs to optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: MIP models for connected facility location: a theoretical and computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-cut-and-price for capacitated connected facility location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two phase algorithms for the bi-objective assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4889471 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-directional local search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards optimizing the deployment of optical access networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On implementing the push-relabel method for the maximum flow problem / rank
 
Normal rank

Revision as of 23:00, 12 July 2024

scientific article
Language Label Description Also known as
English
ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design
scientific article

    Statements

    ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 November 2016
    0 references
    bi-objective connected facility location
    0 references
    \(k\)-architecture connected facility location
    0 references
    branch-and-cut
    0 references
    local branching
    0 references
    neighborhood search
    0 references
    ILP heuristics
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers