Pages that link to "Item:Q3818144"
From MaRDI portal
The following pages link to AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM (Q3818144):
Displayed 24 items.
- A two-stage approach to the orienteering problem with stochastic weights (Q336923) (← links)
- Time constrained maximal covering salesman problem with weighted demands and partial coverage (Q342578) (← links)
- The orienteering problem: a survey (Q617509) (← links)
- Multi-objective meta-heuristics for the traveling salesman problem with profits (Q928691) (← links)
- An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits (Q953423) (← links)
- The attractive traveling salesman problem (Q1043335) (← links)
- On symmetric subtour problems (Q1202764) (← links)
- Minimum directed 1-subtree relaxation for score orienteering problem (Q1291640) (← links)
- A heuristic for the multiple tour maximum collection problem (Q1317095) (← links)
- The median tour and maximal covering tour problems: Formulations and heuristics (Q1328602) (← links)
- A hybrid variable neighborhood search for the orienteering problem with mandatory visits and exclusionary constraints (Q1652104) (← links)
- A hybrid dynamic programming and memetic algorithm to the traveling salesman problem with hotel selection (Q1652522) (← links)
- The vehicle routing problem with service level constraints (Q1681277) (← links)
- Formulations for the orienteering problem with additional constraints (Q1686508) (← links)
- A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints (Q1754303) (← links)
- Column generation based heuristics for a generalized location routing problem with profits arising in space exploration (Q1926985) (← links)
- An improvement heuristic based on variable neighborhood search for a dynamic orienteering problem (Q2233517) (← links)
- Formulation and a two-phase matheuristic for the roaming salesman problem: application to election logistics (Q2273922) (← links)
- A fast solution method for the time-dependent orienteering problem (Q2356249) (← links)
- Evolution-inspired local improvement algorithm solving orienteering problem (Q2399337) (← links)
- A stabilized column generation scheme for the traveling salesman subtour problem (Q2433808) (← links)
- Multi-objective vehicle routing problems (Q2480968) (← links)
- A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem (Q3057103) (← links)
- The orienteering problem with variable profits (Q5326782) (← links)