Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Ronald L. Rardin
Information about the author Ronald L. Rardin will soon be added to the site.
Found
12 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
A collaboratory for radiation therapy treatment planning optimization research
2006
Intensity modulated radiation therapy treatment planning (IMRTP) is a challenging...
Column generation for intensity modulated radiation treatment cancer therapy optimization with implementable segments
2006
A radiation beam passes through normal tissue to reach tumor. The latest devices for...
Experimental evaluation of heuristic optimization algorithms: A tutorial
2001
Heuristic optimization algorithms seek good feasible solutions to optimization...
Using a hybrid of exact and genetic algorithms to design survivable networks
2002
Wide-band technology has the capability to carry many services such as voice, video...
Commodity family extended formulations of uncapacitated fixed charge network flow problems
1997
Uncapacitated fixed charge network flow problems are single-commodity flow problems...
A design methodology for fractal layout organization
1997
This paper proposes a methodology for designing job shops under the fractal layout...
Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
1993
Multicommodity extended formulations of single source uncapacitated fixed charge...
Tabu search for a class of scheduling problems
1993
Scheduling problems are often modeled as resource constrained problems in which...
Gainfree Leontief substitution flow problems
1992
Leontief substitution systems have been studied by economists and operations...
Partial polyhedral description and generation of discrete optimization problems with known optima
1992
The authors detail a random cut concept for generating instances of discrete...
Paroids: A canonical format for combinatorial optimization
1992
Almost all successful exact approaches to hard combinatorial optimization problems are...
Polyhedral characterization of discrete dynamic programming
1990
Many interesting combinatorial problems can be optimized efficiently using recursive...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers