Ronald L. Rardin

Available identifiers

zbMath Open rardin.ronald-lMaRDI QIDQ204963

List of research outcomes

Publication	Date of Publication	Type
Budget constrained model selection for multiple linear regression	2024-01-23	Paper
Strong valid inequalities for fluence map optimization problem under dose-volume restrictions	2012-11-15	Paper
Production planning with resources subject to congestion	2009-04-22	Paper
Matching daily healthcare provider capacity to demand in advanced access scheduling systems	2007-07-04	Paper
Column generation for IMRT cancer therapy optimization with implementable segments	2007-02-05	Paper
A coupled column generation, mixed integer approach to optimal planning of intensity modulated radiation therapy for cancer	2005-02-24	Paper
Using a hybrid of exact and genetic algorithms to design survivable networks	2003-03-18	Paper
Experimental evaluation of heuristic optimization algorithms: A tutorial	2001-11-19	Paper
Analysis of a random cut test instance generator for the TSP	2001-09-18	Paper
https://portal.mardi4nfdi.de/entity/Q4355486	1997-09-21	Paper
The dominant of the 2-connected-Steiner-subgraph polytope for \(W_ 4\)-free graphs	1996-09-30	Paper
Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems	1994-05-05	Paper
Paroid search: Generic local combinatorial optimization	1994-05-05	Paper
Linear‐time algorithms for the 2‐connected steiner subgraph problem on special classes of graphs	1993-09-05	Paper
Tabu search for a class of scheduling problems	1993-08-16	Paper
Gainfree Leontief substitution flow problems	1993-06-29	Paper
https://portal.mardi4nfdi.de/entity/Q4040299	1993-06-05	Paper
https://portal.mardi4nfdi.de/entity/Q4017559	1993-01-16	Paper
Paroids: A canonical format for combinatorial optimization	1993-01-16	Paper
Polyhedral Characterization of Discrete Dynamic Programming	1990-01-01	Paper
Surrogate duality in a branch-and-bound procedure for integer programming	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3804448	1987-01-01	Paper
An efficiently solvable case of the minimum weight equivalent subgraph problem	1985-01-01	Paper
On finding spanning eulerian subgraphs	1985-01-01	Paper
Guaranteed performance heuristics for the bottleneck traveling salesman problem	1984-01-01	Paper
Surrogate Dual Multiplier Search Procedures in Integer Programming	1984-01-01	Paper
Surrogate duality in a branch-and-bound procedure	1981-01-01	Paper
Technical Note—Searchability of the Composite and Multiple Surrogate Dual Functions	1980-01-01	Paper
Some relationships between lagrangian and surrogate duality in integer programming	1979-01-01	Paper
An algorithm for finding the shortest element of a polyhedral set with application to Lagrangian duality	1978-01-01	Paper
Optimal Design of Regional Wastewater Systems: A Fixed-Charge Network Flow Model	1978-01-01	Paper
What makes integer programming problems hard to solve: An empirical study	1978-01-01	Paper
A finite steepest-ascent algorithm for maximizing piecewise-linear concave functions	1978-01-01	Paper
Development of a Parametric Generating Procedure for Integer Programming Test Problems	1977-01-01	Paper
Technical Note—Surrogate Constraints and the Strength of Bounds Derived from 0-1 Benders' Partitioning Procedures	1977-01-01	Paper
Solving fixed charge network problems with group theory-based penalties	1976-01-01	Paper
Some computationally relevant group theoretic structures of fixed charge problems	1976-01-01	Paper

Research outcomes over time

This page was built for person: Ronald L. Rardin