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