Ronald L. Rardin

According to our database1, Ronald L. Rardin authored at least 34 papers between 1976 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Budget constrained model selection for multiple linear regression.
Commun. Stat. Simul. Comput., November, 2023

2016
Robust optimization policy benchmarks and modeling errors in natural gas.
Eur. J. Oper. Res., 2016

2014
Biologically guided intensity modulated radiation therapy planning optimization with fraction-size dose constraints.
J. Oper. Res. Soc., 2014

Statistical optimum estimation techniques for combinatorial optimization problems: a review and critique.
J. Heuristics, 2014

2012
A mean-variance model to optimize the fixed versus open appointment percentages in open access scheduling systems.
Decis. Support Syst., 2012

Strong valid inequalities for fluence map optimization problem under dose-volume restrictions.
Ann. Oper. Res., 2012

2011
A Novel GS1 Data Standard Adoption Roadmap for Healthcare Providers.
Int. J. Heal. Inf. Syst. Informatics, 2011

Single versus hybrid time horizons for open access scheduling.
Comput. Ind. Eng., 2011

2010
Robust strategies for natural gas procurement.
Eur. J. Oper. Res., 2010

2008
Regulation of Natural Gas Distribution Using Policy Benchmarks.
Oper. Res., 2008

2007
Matching daily healthcare provider capacity to demand in advanced access scheduling systems.
Eur. J. Oper. Res., 2007

2006
Column generation for IMRT cancer therapy optimization with implementable segments.
Ann. Oper. Res., 2006

A collaboratory for radiation therapy treatment planning optimization research.
Ann. Oper. Res., 2006

2004
A coupled column generation, mixed integer approach to optimal planning of intensity modulated radiation therapy for cancer.
Math. Program., 2004

2003
NCI/NSF Workshop on Operations Research Applied to Radiation Therapy Washington, DC, February 7-9, 2002.
Ann. Oper. Res., 2003

2002
Using a hybrid of exact and genetic algorithms to design survivable networks.
Comput. Oper. Res., 2002

2001
Experimental Evaluation of Heuristic Optimization Algorithms: A Tutorial.
J. Heuristics, 2001

1997
Commodity family extended formulations of uncapacitated fixed charge network flow problems.
Networks, 1997

1996
The Dominant of the 2-connected-Steiner-subgraph Polytope for W<sub>4</sub>-free Graphs.
Discret. Appl. Math., 1996

1993
Linear-time algorithms for the 2-connected steiner subgraph problem on special classes of graphs.
Networks, 1993

Paroid Search: Generic Local Combinatorial Optimization.
Discret. Appl. Math., 1993

Tabu search for a class of scheduling problems.
Ann. Oper. Res., 1993

1992
Gainfree Leontief substitution flow problems.
Math. Program., 1992

Paroids: A Canonical Format for Combinatorial Optimization.
Discret. Appl. Math., 1992

1990
Polyhedral Characterization of Discrete Dynamic Programming.
Oper. Res., 1990

1988
Discrete optimization.
Computer science and scientific computing, Academic Press, ISBN: 978-0-12-545075-1, 1988

1985
An efficiently solvable case of the minimum weight equivalent subgraph problem.
Networks, 1985

1984
Surrogate Dual Multiplier Search Procedures in Integer Programming.
Oper. Res., 1984

1980
Technical Note - Searchability of the Composite and Multiple Surrogate Dual Functions.
Oper. Res., 1980

1979
Some relationships between lagrangian and surrogate duality in integer programming.
Math. Program., 1979

1978
Optimal Design of Regional Wastewater Systems: A Fixed-Charge Network Flow Model.
Oper. Res., 1978

1977
Development of a Parametric Generating Procedure for Integer Programming Test Problems.
J. ACM, 1977

1976
Some computationally relevant group theoretic structures of fixed charge problems.
Math. Program., 1976

Technical Note - Surrogate Constraints and the Strength of Bounds Derived from 0-1 Benders' Partitioning Procedures.
Oper. Res., 1976


  Loading...