The prize collecting traveling salesman problem
From MaRDI portal
Publication:3832349
DOI10.1002/net.3230190602zbMath0676.90089OpenAlexW1986056047MaRDI QIDQ3832349
Publication date: 1989
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230190602
schedulingpolytopecutting planesrouting problemsknapsack polytopefacet defining inequalitiesPrize Collecting Traveling Salesman Problem
Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Polytopes and polyhedra (52Bxx)
Related Items
Making opportunity sales in attended home delivery, FIXED RATIO POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR THE PRIZE-COLLECTING ASYMMETRIC TRAVELING SALESMAN PROBLEM, Solving Steiner trees: Recent advances, challenges, and perspectives, A revisited branch-and-cut algorithm for large-scale orienteering problems, Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem, Hybrid genetic algorithm for undirected traveling salesman problems with profits, A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems, Exact and heuristic solutions for the prize‐collecting geometric enclosure problem, Designing Reliable IP Networks with an Access/Edge/Core Hierarchical Structure, A bi-criteria moving-target travelling salesman problem under uncertainty, Prize-collecting asymmetric traveling salesman problem admits polynomial time approximation within a constant ratio, The hazardous orienteering problem, Approximation algorithms for the restricted \(k\)-Chinese postman problems with penalties, Models for a Steiner ring network design problem with revenues, Facets of the \(p\)-cycle polytope, The median tour and maximal covering tour problems: Formulations and heuristics, Notes on the single route lateral transhipment problem, Topological design of a two-level network with ring-star configuration, A distributed exact algorithm for the multiple resource constrained sequencing problem, Algorithms for the on-line quota traveling salesman problem, Modeling lotsizing and scheduling problems with sequence dependent setups, Locating median cycles in networks, From Cost Sharing Mechanisms to Online Selection Problems, The time constrained maximal covering salesman problem, Robust optimization for routing problems on trees, Multiobjective GRASP with path relinking, Exact algorithms for budgeted prize-collecting covering subgraph problems, A constrained matching problem, Network repair crew scheduling and routing for emergency relief distribution problem, Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests, Integer programming formulations for the elementary shortest path problem, The Canadian tour operator problem on paths: tight bounds and resource augmentation, Geometric hitting set, set cover and generalized class cover problems with half-strips in opposite directions, The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach, Multi-vehicle prize collecting arc routing for connectivity problem, An efficient evolutionary algorithm for the orienteering problem, Routing problems: A bibliography, Two multi-start heuristics for the \(k\)-traveling salesman problem, Synchronized Traveling Salesman Problem, On the nucleolus of the basic vehicle routing game, A Fast Lower Bound for the Minimum Cost Perfect 2-Matching Linear Program, An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem, STRUCTURAL AND EXTREMAL PROPERTIES OF THE HOT ROLLING BATCHES PRECEDENCE GRAPH, Column generation based heuristics for a generalized location routing problem with profits arising in space exploration, The restricted Chinese postman problems with penalties, A 4-approximation algorithm for \(k\)-prize collecting Steiner tree problems, Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems, The time-dependent capacitated profitable tour problem with time windows and precedence constraints, Multiperiod integrated spare parts and tour planning for on-site maintenance activities with stochastic repair requests, The transit route arc-node service maximization problem, Solving Relaxation Orienteering Problem Using DCA-CUT, The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches, A primal-dual approximation algorithm for the asymmetric prize-collecting TSP, Euclidean prize-collecting Steiner forest, Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to the asymmetric traveling salesman problem, A stabilized column generation scheme for the traveling salesman subtour problem, Unnamed Item, A unified matheuristic for solving multi-constrained traveling salesman problems with profits, Algorithmic expedients for the prize collecting Steiner tree problem, Approximation algorithms for supply chain planning and logistics problems with market choice, Multi-objective meta-heuristics for the traveling salesman problem with profits, Interdiction Games and Monotonicity, with Application to Knapsack Problems, Unnamed Item, Improved bounds for revenue maximization in time-limited online dial-a-ride, An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits, Weighted matching with pair restrictions, The packing while traveling problem, A note on the prize collecting traveling salesman problem, On symmetric subtour problems, Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem, Local search algorithms for the red-blue median problem, The online prize-collecting traveling salesman problem, Multi-objective vehicle routing problems, Development of hybrid evolutionary algorithms for production scheduling of hot strip mill, Capacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setups, Unnamed Item, A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times, A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem, Exact solution of the soft-clustered vehicle-routing problem, Mixed integer formulations for a routing problem with information collection in wireless networks, Formulation and a two-phase matheuristic for the roaming salesman problem: application to election logistics, Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements, A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem, The dynamic dispatch waves problem for same-day delivery, Capacitated ring arborescence problems with profits, Approximation algorithms for group prize-collecting and location-routing problems, An approximation algorithm for vehicle routing with compatibility constraints, Bumblebee visitation problem, Modeling the Mobile Oil Recovery Problem as a Multiobjective Vehicle Routing Problem, A fast and effective heuristic for the orienteering problem, The vehicle routing-allocation problem: A unifying framework, A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs, A tabu search heuristic for the vehicle routing problem with private fleet and common carrier, Strong lower bounds for the prize collecting Steiner problem in graphs, A simple rounding scheme for multistage optimization, Minimum directed 1-subtree relaxation for score orienteering problem, A model for warehouse order picking, The multicommodity traveling salesman problem with priority prizes: a mathematical model and metaheuristics, An efficient composite heuristic for the symmetric generalized traveling salesman problem, Soft OR and Practice: The Contribution of the Founders of Operations Research, A constant-factor approximation algorithm for the \(k\)-MST problem, Approximation algorithms for time-dependent orienteering., Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree, The traveling salesman problem with few inner points, Approximating minimum-cost connected \(T\)-joins, A location-or-routing problem with partial and decaying coverage, A heuristic for the multiple tour maximum collection problem, Primal-dual approximation algorithms for submodular cost set cover problems with linear/submodular penalties, Compact formulations of the Steiner traveling salesman problem and related problems, The hot strip mill production scheduling problem: A tabu search approach, Exact approaches for solving robust prize-collecting Steiner tree problems, Pricing, relaxing and fixing under lot sizing and scheduling, Serving rides of equal importance for time-limited dial-a-ride, LP-based algorithms for multistage minimization problems, A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs
Cites Work
