default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAchim Bachem
Person information
- affiliation: German Aerospace Center, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1996
[j11]Achim Bachem, Winfried Hochstättler, Barthel Steckemetz, A. Volmer:
Computational experience with general equilibrium problems. Comput. Optim. Appl. 6(3): 213-225 (1996)- [j10]Achim Bachem, Winfried Hochstättler, Martin Malich:
The Simulated Trading Heuristic for Solving Vehicle Routing Problems. Discret. Appl. Math. 65(1-3): 47-72 (1996) - [c5]Achim Bachem, Christian Gawron
, Christoph Moll, Marcus Rickert, Peter Wagner:
Microscopic Traffic Simulations of Road Networks Using High-Performance Computers. HPCN Europe 1996: 306-311 - 1995
- [j9]Jörg-Thomas Pfenning, Achim Bachem, Ronald Minnich:
Virtual shared memory programming on workstation clusters. Future Gener. Comput. Syst. 11(4-5): 387-399 (1995) - 1993
- [c4]Achim Bachem, Winfried Hochstättler, Martin Malich:
Simulated Trading - A New Parallel Approach for Solving Vehicle Routing Problems. PARCO 1993: 471-476 - 1992
- [c3]Achim Bachem, Michael Wottawa:
Parallelisierung von Heuristiken für große Traveling-Salesman-Probleme. Transputer-Anwender-Treffen 1992: 204-213 - [c2]Achim Bachem, Martin Strietzel:
Eine parallele Implementation des Karmakar-Verfahrens. Transputer-Anwender-Treffen 1992: 245-254
1980 – 1989
- 1989
- [j8]Achim Bachem, Alfred Wanka:
Euclidean intersection properties. J. Comb. Theory B 47(1): 10-19 (1989) - 1988
- [j7]Achim Bachem, Walter Kern:
On sticky matroids. Discret. Math. 69(1): 11-18 (1988) - [j6]Achim Bachem, Alfred Wanka:
Separation theorems for oriented matroids. Discret. Math. 70(3): 303-310 (1988) - 1986
- [j5]Achim Bachem, Walter Kern:
Adjoints of oriented matroids. Comb. 6(4): 299-308 (1986) - [j4]Achim Bachem, Walter Kern:
Extension Equivalence of Oriented Matroids. Eur. J. Comb. 7(3): 193-197 (1986) - 1983
- [e1]Achim Bachem, Bernhard Korte, Martin Grötschel:
Mathematical Programming The State of the Art, XIth International Symposium on Mathematical Programming, Bonn, Germany, August 23-27, 1982. Springer 1983, ISBN 978-3-642-68876-8 [contents] - 1982
- [j3]Achim Bachem, Ellis L. Johnson, Rainer Schrader:
A characterization of minimal valid inequalities for mixed integer programs. Oper. Res. Lett. 1(2): 63-66 (1982) - [c1]Achim Bachem, Bernhard Korte, Martin Grötschel:
Scientific Program. ISMP 1982: 605-648
1970 – 1979
- 1979
- [j2]Achim Bachem, Bernhard Korte:
On the RAS-algorithm. Computing 23(2): 189-198 (1979) - [j1]Ravindran Kannan, Achim Bachem:
Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix. SIAM J. Comput. 8(4): 499-507 (1979)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
