Pages that link to "Item:Q687042"

The following pages link to A note on the prize collecting traveling salesman problem (Q687042):

Displaying 50 items.

• Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique (Q278736) (← links)
• Robust optimization for routing problems on trees (Q301384) (← links)
• Risk models for the prize collecting Steiner tree problems with interval data (Q403434) (← links)
• An approximation algorithm for the generalized \(k\)-multicut problem (Q423940) (← 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)
• Approximation algorithms for supply chain planning and logistics problems with market choice (Q647392) (← links)
• Approximating the tree and tour covers of a graph (Q688437) (← links)
• Survivable networks, linear programming relaxations and the parsimonious property (Q689117) (← links)
• Local search algorithms for the red-blue median problem (Q692631) (← links)
• An approximation algorithm for \(k\)-facility location problem with linear penalties using local search scheme (Q724755) (← links)
• Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing (Q848846) (← links)
• Elementary approximation algorithms for prize collecting Steiner tree problems (Q963393) (← links)
• Approximation algorithms for group prize-collecting and location-routing problems (Q1003471) (← links)
• A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs (Q1025987) (← links)
• A tabu search heuristic for the vehicle routing problem with private fleet and common carrier (Q1026772) (← links)
• An improved approximation ratio for the minimum latency problem (Q1290636) (← links)
• A divide and conquer matheuristic algorithm for the prize-collecting Steiner tree problem (Q1651621) (← links)
• Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems (Q1681305) (← links)
• A primal-dual algorithm for the generalized prize-collecting Steiner forest problem (Q1706681) (← links)
• Online covering salesman problem (Q1743496) (← links)
• Weighted matching with pair restrictions (Q1749789) (← links)
• Online constrained forest and prize-collecting network design (Q1755747) (← links)
• The vehicle routing-allocation problem: A unifying framework (Q1814811) (← links)
• Strong lower bounds for the prize collecting Steiner problem in graphs (Q1827870) (← links)
• A primal-dual approximation algorithm for the asymmetric prize-collecting TSP (Q1944387) (← 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)
• Approximation algorithms for general cluster routing problem (Q2019492) (← links)
• An exact solution method for the TSP with drone based on decomposition (Q2026993) (← links)
• A simple rounding scheme for multistage optimization (Q2077374) (← links)
• Approximation algorithms with constant ratio for general cluster routing problems (Q2084625) (← links)
• Serving rides of equal importance for time-limited dial-a-ride (Q2117614) (← links)
• LP-based algorithms for multistage minimization problems (Q2117680) (← links)
• An approximation algorithm for the generalized prize-collecting Steiner forest problem with submodular penalties (Q2136518) (← links)
• Approximation algorithm with constant ratio for stochastic prize-collecting Steiner tree problem (Q2165784) (← links)
• An approximation algorithm for the group prize-collecting Steiner tree problem with submodular penalties (Q2167423) (← links)
• Primal-dual approximation algorithms for submodular cost set cover problems with linear/submodular penalties (Q2353460) (← links)
• Exact approaches for solving robust prize-collecting Steiner tree problems (Q2355891) (← links)
• A 5-approximation algorithm for the \(k\)-prize-collecting Steiner tree problem (Q2421447) (← links)
• The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches (Q2427392) (← links)
• Euclidean prize-collecting Steiner forest (Q2429324) (← 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)
• A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem (Q2496025) (← links)
• The node-edge weighted 2-edge connected subgraph problem: linear relaxation, facets and separation (Q2506819) (← links)
• An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem (Q2583134) (← links)
• The rainbow Steiner tree problem (Q2669791) (← links)
• The restricted Chinese postman problems with penalties (Q2670442) (← links)
• Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to the asymmetric traveling salesman problem (Q2689288) (← links)