Pages that link to "Item:Q3832349"

The following pages link to The prize collecting traveling salesman problem (Q3832349):

Displaying 50 items.

• A primal-dual approximation algorithm for the asymmetric prize-collecting TSP (Q1944387) (← links)
• Algorithmic expedients for the prize collecting Steiner tree problem (Q1952504) (← links)
• Improved bounds for revenue maximization in time-limited online dial-a-ride (Q1981946) (← links)
• A simple rounding scheme for multistage optimization (Q2077374) (← links)
• A location-or-routing problem with partial and decaying coverage (Q2108134) (← links)
• Serving rides of equal importance for time-limited dial-a-ride (Q2117614) (← links)
• LP-based algorithms for multistage minimization problems (Q2117680) (← links)
• A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs (Q2118082) (← links)
• Exact algorithms for budgeted prize-collecting covering subgraph problems (Q2147080) (← links)
• A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times (Q2270448) (← links)
• Exact solution of the soft-clustered vehicle-routing problem (Q2272311) (← links)
• Mixed integer formulations for a routing problem with information collection in wireless networks (Q2273919) (← links)
• Formulation and a two-phase matheuristic for the roaming salesman problem: application to election logistics (Q2273922) (← links)
• Capacitated ring arborescence problems with profits (Q2284638) (← links)
• An approximation algorithm for vehicle routing with compatibility constraints (Q2294242) (← links)
• The multicommodity traveling salesman problem with priority prizes: a mathematical model and metaheuristics (Q2327442) (← links)
• Approximating minimum-cost connected \(T\)-joins (Q2345942) (← 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)
• Pricing, relaxing and fixing under lot sizing and scheduling (Q2355959) (← links)
• Topological design of a two-level network with ring-star configuration (Q2367422) (← links)
• A distributed exact algorithm for the multiple resource constrained sequencing problem (Q2368093) (← links)
• A 4-approximation algorithm for \(k\)-prize collecting Steiner tree problems (Q2414116) (← 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)
• Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem (Q2479572) (← links)
• Multi-objective vehicle routing problems (Q2480968) (← links)
• A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem (Q2496025) (← links)
• The traveling salesman problem with few inner points (Q2583717) (← links)
• Multiobjective GRASP with path relinking (Q2629598) (← links)
• Two multi-start heuristics for the \(k\)-traveling salesman problem (Q2656560) (← links)
• The restricted Chinese postman problems with penalties (Q2670442) (← links)
• Multiperiod integrated spare parts and tour planning for on-site maintenance activities with stochastic repair requests (Q2676368) (← links)
• Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to the asymmetric traveling salesman problem (Q2689288) (← links)
• Approximating the asymmetric profitable tour (Q2861509) (← links)
• An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem (Q2940530) (← links)
• A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem (Q3057103) (← links)
• From Cost Sharing Mechanisms to Online Selection Problems (Q3449447) (← links)
• Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements (Q3602838) (← links)
• Modeling the Mobile Oil Recovery Problem as a Multiobjective Vehicle Routing Problem (Q3627705) (← links)
• A Fast Lower Bound for the Minimum Cost Perfect 2-Matching Linear Program (Q4305487) (← links)
• On the cycle polytope of a directed graph (Q4509381) (← links)
• STRUCTURAL AND EXTREMAL PROPERTIES OF THE HOT ROLLING BATCHES PRECEDENCE GRAPH (Q4581423) (← links)
• The prize collecting traveling salesman problem: II. Polyhedral results (Q4861350) (← links)
• Soft OR and Practice: The Contribution of the Founders of Operations Research (Q5003706) (← links)
• (Q5009572) (← links)
• Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree (Q5012805) (← links)
• Synchronized Traveling Salesman Problem (Q5084688) (← links)
• Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems (Q5119847) (← links)