default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLinus Schrage
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j31]Bruce L. Golden
, Linus Schrage, Douglas R. Shier, Lida Anna Apergi:
The power of linear programming: some surprising and unexpected LPs. 4OR 19(1): 15-40 (2021)
2000 – 2009
- 2009
- [j30]Hongsuk Yang, Linus Schrage:
Conditions that cause risk pooling to increase inventory. Eur. J. Oper. Res. 192(3): 837-851 (2009) - [j29]Youdong Lin, Linus Schrage:
The global solver in the LINDO API. Optim. Methods Softw. 24(4-5): 657-668 (2009) - 2008
- [j28]Mustafa K. Atlihan, Linus Schrage:
Generalized filtering algorithms for infeasibility analysis. Comput. Oper. Res. 35(5): 1446-1464 (2008) - [j27]John F. Raffensperger, Linus Schrage:
Scheduling training for a tank battalion: How to measure readiness. Comput. Oper. Res. 35(6): 1844-1864 (2008) - [j26]Nicole DeHoratius, Adam J. Mersereau, Linus Schrage:
Retail Inventory Management When Records Are Inaccurate. Manuf. Serv. Oper. Manag. 10(2): 257-277 (2008) - 2007
- [j25]Linus Schrage, Kevin Cunningham:
Broadening the integer programming audience, the LINDO perspective. Ann. Oper. Res. 149(1): 177-183 (2007) - 2002
- [j24]Syam Menon, Linus Schrage:
Order Allocation for Stock Cutting in the Paper Industry. Oper. Res. 50(2): 324-332 (2002)
1990 – 1999
- 1999
- [j23]Zeger Degraeve, Linus Schrage:
Optimal Integer Solutions to Industrial Cutting Stock Problems. INFORMS J. Comput. 11(4): 406-419 (1999) - 1998
- [j22]Zeger Degraeve, Linus Schrage:
HOP: A software tool for production scheduling at Bridgestone/Firestone off-the-road. Eur. J. Oper. Res. 110(2): 188-198 (1998) - 1997
- [j21]Zeger Degraeve, Linus Schrage:
A Tire Production Scheduling System for Bridgestone/Firestone Off-The-Road. Oper. Res. 45(6): 789-796 (1997) - 1994
- [j20]Jane N. Hagstrom, Ray Hagstrom, Ross A. Overbeek, Morgan Price, Linus Schrage:
Maximum likelihood genetic sequence reconstruction from oligo content. Networks 24(5): 297-302 (1994)
1980 – 1989
- 1989
- [j19]Gary D. Eppen, R. Kipp Martin, Linus Schrage:
OR Practice - A Scenario Approach to Capacity Planning. Oper. Res. 37(4): 517-527 (1989) - 1987
- [b2]Paul Bratley, Bennett L. Fox, Linus Schrage:
A guide to simulation, 2nd Edition. Springer 1987, ISBN 978-3-540-96467-4, pp. I-XX, 1-397 - 1986
- [j18]Gary D. Eppen, R. Kipp Martin, Linus Schrage:
A mixed-integer programming model for evaluating distribution configurations in the steel industry. Comput. Oper. Res. 13(5): 575-586 (1986) - 1985
- [j17]Uday S. Karmarkar, Linus Schrage:
The Deterministic Dynamic Product Cycling Problem. Oper. Res. 33(2): 326-345 (1985) - [j16]R. Kipp Martin, Linus Schrage:
Subset Coefficient Reduction Cuts for 0/1 Mixed-Integer Programming. Oper. Res. 33(3): 505-526 (1985) - [j15]Linus Schrage, Laurence A. Wolsey:
Sensitivity Analysis for Branch and Bound Integer Programming. Oper. Res. 33(5): 1008-1023 (1985) - 1983
- [b1]Paul Bratley, Bennett L. Fox, Linus E. Schrage:
A guide to simulation. Springer 1983, ISBN 354090820X, pp. I-XVIII, 1-383 - 1981
- [j14]Arnoldo C. Hax, Thomas L. Magnanti, Linus Schrage:
Preface. Oper. Res. 29(4): 627 (1981) - [j13]Gamini Gunawardane, Stephen Hoff, Linus Schrage:
Identification of special structure constraints in linear programs. Math. Program. 21(1): 90-97 (1981) - [j12]Linus Schrage:
Formulation and structure of more complex/realistic routing and scheduling problems. Networks 11(2): 229-232 (1981)
1970 – 1979
- 1979
- [j11]Linus Schrage:
A More Portable Fortran Random Number Generator. ACM Trans. Math. Softw. 5(2): 132-138 (1979) - 1978
- [j10]Kenneth R. Baker, Linus Schrage:
Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks. Oper. Res. 26(1): 111-120 (1978) - [j9]Linus Schrage, Kenneth R. Baker:
Dynamic Programming Solution of Sequencing Problems with Precedence Constraints. Oper. Res. 26(3): 444-449 (1978) - [j8]Linus Schrage:
Implicit representation of generalized variable upper bounds in linear programming. Math. Program. 14(1): 11-20 (1978) - 1972
- [j7]Linus Schrage:
Solving Resource-Constrained Network Problems by Implicit Enumeration - Preemptive Case. Oper. Res. 20(3): 668-677 (1972) - 1970
- [j6]Linus Schrage:
Letter to the Editor - An Alternative Proof of a Conservation Law for the Queue G/G/1. Oper. Res. 18(1): 185-187 (1970) - [j5]Linus Schrage:
Solving Resource-Constrained Network Problems by Implicit Enumeration - Nonpreemptive Case. Oper. Res. 18(2): 263-278 (1970)
1960 – 1969
- 1969
- [j4]Linus Schrage:
A Mixed-Priority Queue with Applications to the Analysis of Real-Time Systems. Oper. Res. 17(4): 728-742 (1969) - [j3]Linus Schrage:
Analysis and Optimization of a Queueing Model of a Real-Time Computer Control System. IEEE Trans. Computers 18(11): 997-1003 (1969) - 1968
- [j2]Linus Schrage:
Letter to the Editor - A Proof of the Optimality of the Shortest Remaining Processing Time Discipline. Oper. Res. 16(3): 687-690 (1968) - 1966
- [j1]Linus Schrage, Louis W. Miller:
The Queue M/G/1 with the Shortest Remaining Processing Time Discipline. Oper. Res. 14(4): 670-684 (1966)
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-25 05:59 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:
