( en | de | ru )

 

Disambiguation of "Rardin, Ronald L."

Author of the publication

copydeleteadd this publication to your clipboard
Matching daily healthcare provider capacity to demand in advanced access scheduling systems.

, , , and . Eur. J. Oper. Res., 183 (2): 812-826 (2007)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

L Bräuer

L Solymosi

L Müller

L Eberl

L Ruess

 

Other publications of authors with the same name

Matching daily healthcare provider capacity to demand in advanced access scheduling systems., , , and . Eur. J. Oper. Res., 183 (2): 812-826 (2007)Surrogate Dual Multiplier Search Procedures in Integer Programming., and . Operations Research, 32 (1): 52-69 (1984)Experimental Evaluation of Heuristic Optimization Algorithms: A Tutorial., and . J. Heuristics, 7 (3): 261-304 (2001)Statistical optimum estimation techniques for combinatorial optimization problems: a review and critique., , and . J. Heuristics, 20 (3): 329-358 (2014)Single versus hybrid time horizons for open access scheduling., , and . Comput. Ind. Eng., 60 (1): 56-65 (2011)Tabu search for a class of scheduling problems., and . Ann. Oper. Res., 41 (3): 253-278 (1993)Paroids: A Canonical Format for Combinatorial Optimization., and . Discret. Appl. Math., 39 (1): 37-56 (1992)The Dominant of the 2-connected-Steiner-subgraph Polytope for W4-free Graphs., , , and . Discret. Appl. Math., 66 (1): 33-43 (1996)Technical Note - Surrogate Constraints and the Strength of Bounds Derived from 0-1 Benders' Partitioning Procedures., and . Operations Research, 24 (6): 1169-1175 (1976)Linear-time algorithms for the 2-connected steiner subgraph problem on special classes of graphs., , , and . Networks, 23 (3): 195-206 (1993)