Login / Signup
On Identifying in Polynomial Time Violated Subtour Elimination and Precedence Forcing Constraints for the Sequential Ordering Problem.
Norbert Ascheuer
Laureano F. Escudero
Martin Grötschel
Mechthild Stoer
Published in:
IPCO (1990)
Keyphrases
</>
subtour elimination
traveling salesman problem
partial order
resource constraints
neural network
special case
lp relaxation
dynamic programming
distributed systems
global constraints