default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRonald L. Rardin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1988
[b1]R. Gary Parker, Ronald L. Rardin:
Discrete optimization. Computer science and scientific computing, Academic Press 1988, ISBN 978-0-12-545075-1, pp. I-XI, 1-472
Journal Articles
- 2023
- [j33]Jingying Zhang, Ronald L. Rardin, Justin R. Chimka:
Budget constrained model selection for multiple linear regression. Commun. Stat. Simul. Comput. 52(11): 5537-5549 (2023) - 2016
- [j32]Tarik Aouam
, Kumar Muthuraman, Ronald L. Rardin:
Robust optimization policy benchmarks and modeling errors in natural gas. Eur. J. Oper. Res. 250(3): 807-815 (2016) - 2014
- [j31]Angela P. Giddings, Ronald L. Rardin, Reha Uzsoy:
Statistical optimum estimation techniques for combinatorial optimization problems: a review and critique. J. Heuristics 20(3): 329-358 (2014) - [j30]Behlul Saka, Ronald L. Rardin, Mark P. Langer:
Biologically guided intensity modulated radiation therapy planning optimization with fraction-size dose constraints. J. Oper. Res. Soc. 65(4): 557-571 (2014) - 2012
- [j29]Ali T. Tuncel, Felisa Preciado, Ronald L. Rardin, Mark P. Langer, Jean-Philippe P. Richard:
Strong valid inequalities for fluence map optimization problem under dose-volume restrictions. Ann. Oper. Res. 196(1): 819-840 (2012) - [j28]Xiuli Qu, Ronald L. Rardin, Julie Ann Stuart Williams:
A mean-variance model to optimize the fixed versus open appointment percentages in open access scheduling systems. Decis. Support Syst. 53(3): 554-564 (2012) - 2011
- [j27]Xiuli Qu, Ronald L. Rardin, Julie Ann Stuart Williams:
Single versus hybrid time horizons for open access scheduling. Comput. Ind. Eng. 60(1): 56-65 (2011) - [j26]Nebil Buyurgan, Ronald L. Rardin, Raja Jayaraman, Vijith M. Varghese, Angelica Burbano:
A Novel GS1 Data Standard Adoption Roadmap for Healthcare Providers. Int. J. Heal. Inf. Syst. Informatics 6(4): 42-59 (2011) - 2010
- [j25]Tarik Aouam, Ronald L. Rardin, Jawad Abrache:
Robust strategies for natural gas procurement. Eur. J. Oper. Res. 205(1): 151-158 (2010) - 2008
- [j24]Kumar Muthuraman, Tarik Aouam, Ronald L. Rardin:
Regulation of Natural Gas Distribution Using Policy Benchmarks. Oper. Res. 56(5): 1131-1145 (2008) - 2007
- [j23]Xiuli Qu, Ronald L. Rardin, Julie Ann Stuart Williams, Deanna R. Willis:
Matching daily healthcare provider capacity to demand in advanced access scheduling systems. Eur. J. Oper. Res. 183(2): 812-826 (2007) - 2006
- [j22]Joseph Deasy, Eva K. Lee, T. Bortfeld, Mark P. Langer, K. Zakarian, J. Alaly, Y. Zhang, H. Liu, R. Mohan, R. Ahuja, A. Pollack, J. Purdy, Ronald L. Rardin:
A collaboratory for radiation therapy treatment planning optimization research. Ann. Oper. Res. 148(1): 55-63 (2006) - [j21]Felisa Preciado-Walters, Mark P. Langer, Ronald L. Rardin, Van Thai:
Column generation for IMRT cancer therapy optimization with implementable segments. Ann. Oper. Res. 148(1): 65-79 (2006) - 2004
- [j20]Felisa Preciado-Walters, Ronald L. Rardin, Mark P. Langer, Van Thai:
A coupled column generation, mixed integer approach to optimal planning of intensity modulated radiation therapy for cancer. Math. Program. 101(2): 319-338 (2004) - 2003
- [j19]Eva K. Lee, Joseph Deasy, Mark P. Langer, Ronald L. Rardin, Jim A. Deye, Frank J. Mahoney:
NCI/NSF Workshop on Operations Research Applied to Radiation Therapy Washington, DC, February 7-9, 2002. Ann. Oper. Res. 119(1-4): 143-146 (2003) - 2002
- [j18]Elham Ghashghai, Ronald L. Rardin:
Using a hybrid of exact and genetic algorithms to design survivable networks. Comput. Oper. Res. 29(1): 53-66 (2002) - 2001
- [j17]Ronald L. Rardin, Reha Uzsoy:
Experimental Evaluation of Heuristic Optimization Algorithms: A Tutorial. J. Heuristics 7(3): 261-304 (2001) - 1997
- [j16]Peh H. Ng, Ronald L. Rardin:
Commodity family extended formulations of uncapacitated fixed charge network flow problems. Networks 30(1): 57-71 (1997) - 1996
- [j15]Collette R. Coullard, Abdur Rais, Ronald L. Rardin, Donald K. Wagner:
The Dominant of the 2-connected-Steiner-subgraph Polytope for W4-free Graphs. Discret. Appl. Math. 66(1): 33-43 (1996) - 1993
- [j14]Edward L. Mooney, Ronald L. Rardin:
Tabu search for a class of scheduling problems. Ann. Oper. Res. 41(3): 253-278 (1993) - [j13]Ronald L. Rardin, Moises Sudit:
Paroid Search: Generic Local Combinatorial Optimization. Discret. Appl. Math. 43(2): 155-174 (1993) - [j12]Collette R. Coullard, Abdur Rais, Ronald L. Rardin, Donald K. Wagner:
Linear-time algorithms for the 2-connected steiner subgraph problem on special classes of graphs. Networks 23(3): 195-206 (1993) - 1992
- [j11]Ronald L. Rardin, Moises Sudit:
Paroids: A Canonical Format for Combinatorial Optimization. Discret. Appl. Math. 39(1): 37-56 (1992) - [j10]Robert G. Jeroslow, R. Kipp Martin, Ronald L. Rardin, Jinchang Wang:
Gainfree Leontief substitution flow problems. Math. Program. 57: 375-414 (1992) - 1990
- [j9]R. Kipp Martin, Ronald L. Rardin, Brian A. Campbell:
Polyhedral Characterization of Discrete Dynamic Programming. Oper. Res. 38(1): 127-138 (1990) - 1985
- [j8]Michael B. Richey, R. Gary Parker, Ronald L. Rardin:
An efficiently solvable case of the minimum weight equivalent subgraph problem. Networks 15(2): 217-228 (1985) - 1984
- [j7]Mark H. Karwan, Ronald L. Rardin:
Surrogate Dual Multiplier Search Procedures in Integer Programming. Oper. Res. 32(1): 52-69 (1984) - 1980
- [j6]Mark H. Karwan, Ronald L. Rardin:
Technical Note - Searchability of the Composite and Multiple Surrogate Dual Functions. Oper. Res. 28(5): 1251-1257 (1980) - 1979
- [j5]Mark H. Karwan, Ronald L. Rardin:
Some relationships between lagrangian and surrogate duality in integer programming. Math. Program. 17(1): 320-334 (1979) - 1978
- [j4]John J. Jarvis, Ronald L. Rardin, V. E. Unger, Richard W. Moore, Charles C. Schimpeler:
Optimal Design of Regional Wastewater Systems: A Fixed-Charge Network Flow Model. Oper. Res. 26(4): 538-550 (1978) - 1977
- [j3]Benjamin W. Y. Lin, Ronald L. Rardin:
Development of a Parametric Generating Procedure for Integer Programming Test Problems. J. ACM 24(3): 465-472 (1977) - 1976
- [j2]Ronald L. Rardin, V. E. Unger:
Technical Note - Surrogate Constraints and the Strength of Bounds Derived from 0-1 Benders' Partitioning Procedures. Oper. Res. 24(6): 1169-1175 (1976) - [j1]Ronald L. Rardin, V. E. Unger:
Some computationally relevant group theoretic structures of fixed charge problems. Math. Program. 10(1): 379-400 (1976)
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 2025-01-21 00:14 CET 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:
