AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM

DOI10.15807/JORSJ.31.515MaRDI QIDQ3818144zbMATH OpenOpenAlexFDO

Authors Seiji Kataoka, Susumu Morito

Publication date 1988

Published in Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15807/jorsj.31.515

zbMATH Keywords

assignmentbranch and boundoptimal tourrelaxationTraveling SalesmanVehicle Routing

Mathematics Subject Classification ID

Integer programming (90C10) Programming involving graphs or networks (90C35)

Recommendations

• A heuristic for the multiple tour maximum collection problem
• An optimal solution procedure for the multiple tour maximum collection problem using column generation
• The maximum collection problem with time-dependent rewards
• Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
• The orienteering problem with variable profits

Cited in

(30)

• The attractive traveling salesman problem
• On symmetric subtour problems
• Minimum directed 1-subtree relaxation for score orienteering problem
• An optimal solution procedure for the multiple tour maximum collection problem using column generation
• A heuristic for the multiple tour maximum collection problem
• The median tour and maximal covering tour problems: Formulations and heuristics
• A hybrid variable neighborhood search for the orienteering problem with mandatory visits and exclusionary constraints
• A hybrid dynamic programming and memetic algorithm to the traveling salesman problem with hotel selection
• The vehicle routing problem with service level constraints
• Formulations for the orienteering problem with additional constraints
• A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints
• Column generation based heuristics for a generalized location routing problem with profits arising in space exploration
• An improvement heuristic based on variable neighborhood search for a dynamic orienteering problem
• Formulation and a two-phase matheuristic for the roaming salesman problem: application to election logistics
• A fast solution method for the time-dependent orienteering problem
• Evolution-inspired local improvement algorithm solving orienteering problem
• A stabilized column generation scheme for the traveling salesman subtour problem
• Multi-objective vehicle routing problems
• A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem
• A two-stage approach to the orienteering problem with stochastic weights
• Time constrained maximal covering salesman problem with weighted demands and partial coverage
• A method for optimizing the collection of pallets using the traveling salesman problem
• The orienteering problem with variable profits
• The maximum collection problem with time-dependent rewards
• The orienteering problem: a survey
• The team orienteering problem with variable time windows
• A survey on approximability of traveling salesman problems using the TSP-T3CO definition scheme
• A unifying framework for selective routing problems
• Multi-objective meta-heuristics for the traveling salesman problem with profits
• An exact -constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits

This page was built for publication: AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3818144)