Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.

Norbert Ascheuer

2000 – 2009

see FAQ

What is the meaning of the colors in the publication list?

2000
[j3]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/coap/AscheuerJR00
- ask others
Norbert Ascheuer, Michael Jünger, Gerhard Reinelt: A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints. Comp. Opt. and Appl. 17(1): 61-84 (2000)
[j2]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/networks/AscheuerFG00
- ask others
Norbert Ascheuer, Matteo Fischetti, Martin Grötschel: A polyhedral study of the asymmetric traveling salesman problem with time windows. Networks 36(2): 69-79 (2000)
[c2]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/stacs/AscheuerKR00
- ask others
Norbert Ascheuer, Sven Oliver Krumke, Jörg Rambau: Online Dial-a-Ride Problems: Minimizing the Completion Time. STACS 2000: 639-650

1990 – 1999

see FAQ

What is the meaning of the colors in the publication list?

1999
[j1]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/mmor/AscheuerGA99
- ask others
Norbert Ascheuer, Martin Grötschel, Atef Abdel-Aziz Abdel-Hamid: Order picking in an automatic warehouse: Solving online asymmetric TSPs. Math. Meth. of OR 49(3): 501-515 (1999)
1990
[c1]
- no documents available
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/ipco/AscheuerEGS90
- ask others
Norbert Ascheuer, Laureano F. Escudero, Martin Grötschel, Mechthild Stoer: On Identifying in Polynomial Time Violated Subtour Elimination and Precedence Forcing Constraints for the Sequential Ordering Problem. IPCO 1990: 19-28