A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks

doi 10.1007/978-3-540-75520-3_60
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

Springer Berlin Heidelberg

Related search

Prize-Collecting Steiner Network Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Reduction Techniques for the Prize Collecting Steiner Tree Problem and the Maximum-Weight Connected Subgraph Problem

Networks
Information SystemsComputer NetworksHardwareCommunicationsArchitectureSoftware
2018English

New Pruning Rules for the Steiner Tree Problem and 2-Connected Steiner Network Problem

Computational Geometry: Theory and Applications
ControlOptimizationGeometryComputational TheoryComputer Science ApplicationsComputational MathematicsMathematicsTopology
2019English

Performance of a Cavity-Method-Based Algorithm for the Prize-Collecting Steiner Tree Problem on Graphs

Physical Review E
2012English

A Prize Collecting Steiner Tree Approach to Least Cost Evaluation of Grid and Off-Grid Electrification Systems

Energy
ManagementMonitoringManufacturing EngineeringElectricalPolicyMechanical EngineeringEnergy EngineeringSustainabilityConstructionModelingLawBuildingElectronic EngineeringRenewable EnergyFuel TechnologyStructural EngineeringSimulationPower TechnologyPollutionIndustrialCivilEnergythe Environment
2018English

An ILP Formulation for Yield-Driven Architectural Synthesis

English

Efficient Cost-Sharing Mechanisms for Prize-Collecting Problems

Mathematical Programming, Series B
MathematicsSoftware
2014English

Hybrid Metaheuristic for the Prize Collecting Travelling Salesman Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2008English

A New Bound for the 2-Edge Connected Subgraph Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1998English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy