Strong linear programming relaxations for the orienteering problem (Q1328645): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4205235 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Modeling Language for Mathematical Programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3792511 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3795496 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finding All the Elementary Circuits of a Directed Graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new polynomial-time algorithm for linear programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithms to solve the orienteering problem: A comparison / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The selective travelling salesman problem / rank | |||
Normal rank |
Latest revision as of 17:04, 22 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Strong linear programming relaxations for the orienteering problem |
scientific article |
Statements
Strong linear programming relaxations for the orienteering problem (English)
0 references
1 March 1995
0 references
relaxation
0 references
routing
0 references
orienteering problem
0 references
0-1 integer program
0 references
NP-hard
0 references
upper bounds
0 references