Pages that link to "Item:Q5191136"

The following pages link to Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints (Q5191136):

Displaying 19 items.

• Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem (Q337245) (← links)
• A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks (Q452816) (← links)
• Sustainable vegetable crop supply problem with perishable stocks (Q475237) (← links)
• Natural and extended formulations for the time-dependent traveling salesman problem (Q496646) (← links)
• The Steiner tree problem with delays: a compact formulation and reduction procedures (Q496653) (← links)
• MIP models for connected facility location: a theoretical and computational study (Q709181) (← links)
• An efficient algorithm for the Steiner tree problem with revenue, bottleneck and hop objective functions (Q992574) (← links)
• An integer linear programming approach for approximate string comparison (Q1042045) (← links)
• Layered graph approaches for combinatorial optimization problems (Q1628112) (← links)
• Branch-and-price approaches for the network design problem with relays (Q1651598) (← links)
• Exact algorithms for bi-objective ring tree problems with reliability measures (Q1652601) (← links)
• A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints (Q1694297) (← links)
• A branch-and-cut algorithm for the Steiner tree problem with delays (Q1926621) (← links)
• Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem (Q2028800) (← links)
• Exact algorithms for budgeted prize-collecting covering subgraph problems (Q2147080) (← links)
• Optimal Network Design with End-to-End Service Requirements (Q4604906) (← links)
• MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
• A comparison of node‐based and arc‐based hop‐indexed formulations for the Steiner tree problem with hop constraints (Q6066244) (← links)
• Maximum weighted induced forests and trees: new formulations and a computational comparative review (Q6071056) (← links)