Pages that link to "Item:Q4210146"

The following pages link to New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen (Q4210146):

Displaying 32 items.

• Optimal deterministic algorithms for some variants of online quota traveling salesman problem (Q296870) (← links)
• Algorithms for the on-line quota traveling salesman problem (Q834904) (← links)
• Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing (Q848846) (← links)
• Multi-objective meta-heuristics for the traveling salesman problem with profits (Q928691) (← links)
• An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits (Q953423) (← links)
• The online prize-collecting traveling salesman problem (Q963439) (← links)
• The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation (Q987675) (← links)
• Approximating buy-at-bulk and shallow-light \(k\)-Steiner trees (Q1017907) (← links)
• Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems (Q1681305) (← links)
• Application of fuzzy optimization to the orienteering problem (Q1750202) (← links)
• Local search algorithms for the \(k\)-cardinality tree problem. (Q1811129) (← links)
• Formulation and a two-phase matheuristic for the roaming salesman problem: application to election logistics (Q2273922) (← links)
• A 4-approximation algorithm for \(k\)-prize collecting Steiner tree problems (Q2414116) (← links)
• A 5-approximation algorithm for the \(k\)-prize-collecting Steiner tree problem (Q2421447) (← links)
• Pruning 2-connected graphs (Q2428662) (← links)
• Approximation algorithms for the traveling repairman and speeding deliveryman problems (Q2428683) (← links)
• A stabilized column generation scheme for the traveling salesman subtour problem (Q2433808) (← links)
• Complexity and approximation for traveling salesman problems with profits (Q2441781) (← links)
• Multi-objective vehicle routing problems (Q2480968) (← links)
• An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210) (← links)
• A \(2+\varepsilon\) approximation algorithm for the \(k\)-MST problem (Q2492706) (← links)
• A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem (Q2496025) (← links)
• Networks of polynomial pieces with application to the analysis of point clouds and images (Q2654450) (← links)
• Orienteering problem with time-windows and updating delay (Q2658039) (← links)
• Quota travelling salesman problem with passengers, incomplete ride and collection time optimization by ant-based algorithms (Q2664292) (← links)
• Dynamic Traveling Repair Problem with an Arbitrary Time Window (Q2971153) (← links)
• A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem (Q3057103) (← links)
• Exploring and Triangulating a Region by a Swarm of Robots (Q3088095) (← links)
• A Constant Factor Approximation for Minimum λ-Edge-Connected k-Subgraph with Metric Costs (Q5900474) (← links)
• Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph (Q5963643) (← links)
• A 2-approximation for the \(k\)-prize-collecting Steiner tree problem (Q5970779) (← links)
• A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems (Q6151530) (← links)