Strong lower bounds for the prize collecting Steiner problem in graphs
From MaRDI portal
Publication:1827870
DOI10.1016/S0166-218X(03)00380-9zbMath1056.90119MaRDI QIDQ1827870
Mauricio G. C. Resende, Abilio Lucena
Publication date: 6 August 2004
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items
Strength of Three MIP Formulations for the Prize Collecting Steiner Tree Problem with a Quota Constraint, Optimal relay node placement in delay constrained wireless sensor network design, Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice, A strong symmetric formulation for the min-degree constrained minimum spanning tree problem, The tree-star problem: a formulation and a branch-and-cut algorithm, A divide and conquer matheuristic algorithm for the prize-collecting Steiner tree problem, Lagrangian and branch-and-cut approaches for upgrading spanning tree problems, On imposing connectivity constraints in integer programs, The coastal seaspace patrol sector design and allocation problem, Risk models for the prize collecting Steiner tree problems with interval data, The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches, Thinning out Steiner trees: a node-based model for uniform edge costs, Algorithmic expedients for the prize collecting Steiner tree problem, A RELAX-AND-CUT ALGORITHM FOR THE KNAPSACK NODE WEIGHTED STEINER TREE PROBLEM, The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm, Reduction tests for the prize-collecting Steiner problem, A fast prize-collecting Steiner forest algorithm for functional analyses in biological networks, MIP models for connected facility location: a theoretical and computational study, A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem, Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints, An efficient algorithm for the Steiner tree problem with revenue, bottleneck and hop objective functions, A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs, Strong Formulations for 2-Node-Connected Steiner Network Problems, An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem, Exact approaches for solving robust prize-collecting Steiner tree problems, Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on the prize collecting traveling salesman problem
- The Steiner tree polytope and related polyhedra
- Tree polytope on 2-trees
- Local search with perturbations for the prize-collecting Steiner tree problem in graphs
- Trees and Cuts
- The node-weighted steiner tree problem
- The prize collecting traveling salesman problem
- Solving Steiner tree problems in graphs to optimality
- Solution of a Large-Scale Traveling-Salesman Problem
- Matroids and the greedy algorithm
- A Graph-Theoretic Equivalence for Integer Programs
