Pages that link to "Item:Q2583134"

The following pages link to An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem (Q2583134):

Displaying 50 items.

• Spanning trees with variable degree bounds (Q297415) (← links)
• Hop constrained Steiner trees with multiple root nodes (Q299847) (← links)
• On exact solutions for the minmax regret spanning tree problem (Q337033) (← links)
• ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design (Q342390) (← links)
• The coastal seaspace patrol sector design and allocation problem (Q395695) (← links)
• Risk models for the prize collecting Steiner tree problems with interval data (Q403434) (← links)
• Solving the quorumcast routing problem by constraint programming (Q487641) (← links)
• A column generation approach for multicast routing and wavelength assignment with delay constraints in heterogeneous WDM networks (Q490218) (← links)
• Exact methods for solving the elementary shortest and longest path problems (Q512936) (← links)
• Prize collecting Steiner trees with node degree dependent costs (Q709134) (← links)
• MIP models for connected facility location: a theoretical and computational study (Q709181) (← links)
• Solving the family traveling salesman problem (Q723922) (← links)
• Lagrangian decompositions for the two-level FTTx network design problem (Q743641) (← links)
• Computing the metric dimension of graphs by genetic algorithms (Q849088) (← links)
• A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs (Q1025987) (← links)
• Combinatorial optimization in system configuration design (Q1027725) (← links)
• A divide and conquer matheuristic algorithm for the prize-collecting Steiner tree problem (Q1651621) (← links)
• Lagrangian and branch-and-cut approaches for upgrading spanning tree problems (Q1652284) (← links)
• A relax-and-cut framework for large-scale maximum weight connected subgraph problems (Q1652399) (← links)
• On imposing connectivity constraints in integer programs (Q1683690) (← links)
• A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints (Q1694297) (← links)
• Thinning out Steiner trees: a node-based model for uniform edge costs (Q1699615) (← links)
• Solving minimum-cost shared arborescence problems (Q1751722) (← links)
• An algorithmic framework for the exact solution of tree-star problems (Q1753556) (← links)
• An exact solution framework for the minimum cost dominating tree problem (Q1800452) (← links)
• Algorithmic expedients for the prize collecting Steiner tree problem (Q1952504) (← links)
• A fast prize-collecting Steiner forest algorithm for functional analyses in biological networks (Q2011601) (← links)
• A branch-and-price procedure for clustering data that are graph connected (Q2060392) (← links)
• A tailored Benders decomposition approach for last-mile delivery with autonomous robots (Q2077920) (← links)
• Lagrangian heuristic for simultaneous subsidization and penalization: implementations on rooted travelling salesman games (Q2123122) (← links)
• Exact algorithms for budgeted prize-collecting covering subgraph problems (Q2147080) (← links)
• Comparison of formulations for the inventory routing problem (Q2160484) (← links)
• Heuristic and exact algorithms for minimum-weight non-spanning arborescences (Q2189916) (← links)
• Capacitated ring arborescence problems with profits (Q2284638) (← links)
• The two-level diameter constrained spanning tree problem (Q2340278) (← links)
• Exact approaches for solving robust prize-collecting Steiner tree problems (Q2355891) (← links)
• The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches (Q2427392) (← links)
• Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem (Q2434979) (← links)
• Towards optimizing the deployment of optical access networks (Q2513732) (← links)
• An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem (Q2583134) (← links)
• Locating leak detecting sensors in a water distribution network by solving prize-collecting Steiner arborescence problems (Q2638378) (← links)
• Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice (Q2638387) (← links)
• Chvátal-Gomory cuts for the Steiner tree problem (Q2659072) (← links)
• New formulations and branch-and-cut procedures for the longest induced path problem (Q2669795) (← links)
• Strength of Three MIP Formulations for the Prize Collecting Steiner Tree Problem with a Quota Constraint (Q2883603) (← links)
• Exact approaches to the single-source network loading problem (Q2892148) (← links)
• Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations (Q2914198) (← links)
• A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems (Q3009777) (← links)
• A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation (Q3057179) (← links)
• The cavity approach for Steiner trees packing problems (Q3303270) (← links)