Exact approaches for solving robust prize-collecting Steiner tree problems (Q2355891): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(8 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2013.03.037 / rank
Normal rank
 
Property / author
 
Property / author: Paolo Toth / rank
Normal rank
 
Property / author
 
Property / author: Paolo Toth / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q62048279 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SteinLib / 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.ejor.2013.03.037 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2118486696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the Bertsimas \& Sim algorithm for robust combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: The prize collecting traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjustable robust solutions of uncertain linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Robustness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the prize collecting traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search with perturbations for the prize-collecting Steiner tree problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new model for path planning with interval data / rank
 
Normal rank
Property / cites work
 
Property / cites work: On implementing the push-relabel method for the maximum flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey and annotated bibliography of multiobjective combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting plane versus compact formulations for uncertain (integer) linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic expedients for the prize collecting Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cover inequalities for robust knapsack sets-Application to the robust bandwidth packing problem / 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: Technical Note—Branch-and-Price-and-Cut Approach to the Robust Network Design Problem Without Flow Bifurcations / 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: Strong lower bounds for the prize collecting Steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating leak detecting sensors in a water distribution network by solving prize-collecting Steiner arborescence problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The node-weighted steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction tests for the prize-collecting Steiner problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2013.03.037 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:15, 18 December 2024

scientific article
Language Label Description Also known as
English
Exact approaches for solving robust prize-collecting Steiner tree problems
scientific article

    Statements

    Exact approaches for solving robust prize-collecting Steiner tree problems (English)
    0 references
    0 references
    0 references
    28 July 2015
    0 references
    prize collecting Steiner trees
    0 references
    robust optimization
    0 references
    interval uncertainty
    0 references
    mixed integer programming
    0 references
    branch-and-cut
    0 references
    0 references
    0 references

    Identifiers