default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKurt Spielberg
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
[j14]Kurt Spielberg, Monique Guignard-Spielberg:
Preface: History of integer programming: distinguished personal notes and reminiscences. Ann. Oper. Res. 149(1): 3-4 (2007)- [j13]Kurt Spielberg:
IP over 40+ Years at IBM Scientific Centers and Marketing. Ann. Oper. Res. 149(1): 195-208 (2007) - 2005
- [j12]Monique Guignard-Spielberg, Kurt Spielberg:
Preface. Ann. Oper. Res. 139(1): 17-20 (2005) - [j11]Monique Guignard-Spielberg, Kurt Spielberg:
Preface. Ann. Oper. Res. 140(1): 17-20 (2005) - [j10]Monique Guignard, Ellis L. Johnson, Kurt Spielberg:
Logical Processing for Integer Programming. Ann. Oper. Res. 140(1): 263-304 (2005)
1990 – 1999
- 1998
- [j9]Monique Guignard, Choonho Ryu, Kurt Spielberg:
Model tightening for integrated timber harvest and transportation planning. Eur. J. Oper. Res. 111(3): 448-460 (1998)
1980 – 1989
- 1981
- [j8]Monique Guignard, Kurt Spielberg:
Logical Reduction Methods in Zero-One Programming - Minimal Preferred Variables. Oper. Res. 29(1): 49-74 (1981)
1970 – 1979
- 1979
- [j7]Monique Guignard, Kurt Spielberg:
A direct dual method for the mixed plant location problem with some side constraints. Math. Program. 17(1): 198-228 (1979) - 1978
- [j6]Laurel Slate, Kurt Spielberg:
The Extended Control Language of MPSX/370 and Possible Applications. IBM Syst. J. 17(1): 64-81 (1978) - 1976
- [c4]Franz Schober, Kurt Spielberg:
APL Econometric Planning Language (EPLAN). APL 1976: 359-387 - 1971
- [j5]Carlton E. Lemke, H. M. Salkin, Kurt Spielberg:
Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems. Oper. Res. 19(4): 998-1022 (1971) - [c3]Michael D. Grigoriadis, L. Papayanopoulos, Kurt Spielberg:
Experimental implementations of mixed integer programming algorithms. ACM Annual Conference 1971: 295-300
1960 – 1969
- 1969
- [j4]Kurt Spielberg:
Algorithms for the Simple Plant-Location Problem with Some Side Conditions. Oper. Res. 17(1): 85-111 (1969) - 1968
- [c2]Monique Guignard, Kurt Spielberg:
Search techniques with adaptive features for certain integer and mixed integer programming problems. IFIP Congress (1) 1968: 238-244 - 1967
- [j3]Carlton E. Lemke, Kurt Spielberg:
Direct Search Algorithms for Zero-One and Mixed-Integer Programming. Oper. Res. 15(5): 892-914 (1967) - 1966
- [j2]Kurt Spielberg:
Computation of ex with the Use of Large Tables. IBM Syst. J. 5(2): 102-114 (1966) - 1964
- [c1]Kurt Spielberg:
On the fixed charge transportation problem. ACM National Conference 1964: 11 - 1961
- [j1]Kurt Spielberg:
Representation of Power Series in Terms of Polynomials, Rational Approximations and Continued Fractions. J. ACM 8(4): 613-627 (1961)
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-04-24 23:13 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:
