AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM

DOI10.15807/jorsj.31.515zbMath0665.90092OpenAlexW2581478119MaRDI QIDQ3818144

Seiji Kataoka, Morito, Susumu

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

branch and boundrelaxationassignmentoptimal tourTraveling SalesmanVehicle Routing

Mathematics Subject Classification ID

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

Related Items (24)

The median tour and maximal covering tour problems: Formulations and heuristics ⋮ A two-stage approach to the orienteering problem with stochastic weights ⋮ 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 ⋮ Time constrained maximal covering salesman problem with weighted demands and partial coverage ⋮ Evolution-inspired local improvement algorithm solving orienteering problem ⋮ The orienteering problem with variable profits ⋮ Column generation based heuristics for a generalized location routing problem with profits arising in space exploration ⋮ The vehicle routing problem with service level constraints ⋮ The orienteering problem: a survey ⋮ Formulations for the orienteering problem with additional constraints ⋮ A stabilized column generation scheme for the traveling salesman subtour problem ⋮ Multi-objective meta-heuristics for the traveling salesman problem with profits ⋮ An improvement heuristic based on variable neighborhood search for a dynamic orienteering problem ⋮ An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits ⋮ A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints ⋮ On symmetric subtour problems ⋮ Multi-objective vehicle routing problems ⋮ Formulation and a two-phase matheuristic for the roaming salesman problem: application to election logistics ⋮ A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem ⋮ Minimum directed 1-subtree relaxation for score orienteering problem ⋮ The attractive traveling salesman problem ⋮ A heuristic for the multiple tour maximum collection problem ⋮ A fast solution method for the time-dependent orienteering problem

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