The following pages link to Ronald L. Rardin (Q204963):
Displaying 38 items.
- Guaranteed performance heuristics for the bottleneck traveling salesman problem (Q786658) (← links)
- Column generation for IMRT cancer therapy optimization with implementable segments (Q863592) (← links)
- Surrogate duality in a branch-and-bound procedure for integer programming (Q1099783) (← links)
- Paroids: A canonical format for combinatorial optimization (Q1199464) (← links)
- (Q1240154) (redirect page) (← links)
- A finite steepest-ascent algorithm for maximizing piecewise-linear concave functions (Q1240155) (← links)
- An algorithm for finding the shortest element of a polyhedral set with application to Lagrangian duality (Q1248461) (← links)
- What makes integer programming problems hard to solve: An empirical study (Q1254013) (← links)
- Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems (Q1319550) (← links)
- Strong valid inequalities for fluence map optimization problem under dose-volume restrictions (Q1761858) (← links)
- A coupled column generation, mixed integer approach to optimal planning of intensity modulated radiation therapy for cancer (Q1764230) (← links)
- Paroid search: Generic local combinatorial optimization (Q1801678) (← links)
- Gainfree Leontief substitution flow problems (Q1802953) (← links)
- The dominant of the 2-connected-Steiner-subgraph polytope for \(W_ 4\)-free graphs (Q1917298) (← links)
- Tabu search for a class of scheduling problems (Q2367005) (← links)
- Matching daily healthcare provider capacity to demand in advanced access scheduling systems (Q2371374) (← links)
- Analysis of a random cut test instance generator for the TSP (Q2743976) (← links)
- Surrogate Dual Multiplier Search Procedures in Integer Programming (Q3325464) (← links)
- Polyhedral Characterization of Discrete Dynamic Programming (Q3496158) (← links)
- Production planning with resources subject to congestion (Q3621923) (← links)
- On finding spanning eulerian subgraphs (Q3703676) (← links)
- An efficiently solvable case of the minimum weight equivalent subgraph problem (Q3706869) (← links)
- A new surrogate dual multiplier search procedure (Q3804448) (← links)
- Some relationships between lagrangian and surrogate duality in integer programming (Q3854930) (← links)
- Technical Note—Searchability of the Composite and Multiple Surrogate Dual Functions (Q3896842) (← links)
- Surrogate duality in a branch-and-bound procedure (Q3901302) (← links)
- Partial polyhedral description and generation of discrete optimization problems with known optima (Q4017559) (← links)
- (Q4040299) (← links)
- Some computationally relevant group theoretic structures of fixed charge problems (Q4114962) (← links)
- Technical Note—Surrogate Constraints and the Strength of Bounds Derived from 0-1 Benders' Partitioning Procedures (Q4117603) (← links)
- Solving fixed charge network problems with group theory-based penalties (Q4123106) (← links)
- Development of a Parametric Generating Procedure for Integer Programming Test Problems (Q4132013) (← links)
- Optimal Design of Regional Wastewater Systems: A Fixed-Charge Network Flow Model (Q4166567) (← links)
- (Q4355486) (← links)
- Linear‐time algorithms for the 2‐connected steiner subgraph problem on special classes of graphs (Q5287453) (← links)
- Experimental evaluation of heuristic optimization algorithms: A tutorial (Q5944365) (← links)
- Using a hybrid of exact and genetic algorithms to design survivable networks (Q5955471) (← links)
- Budget constrained model selection for multiple linear regression (Q6141733) (← links)
