| Publication | Date of Publication | Type |
|---|
| Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic \(0-1\) optimization problems with linear constraints | 2020-05-11 | Paper |
| On dealing with strategic and tactical decision levels in forestry planning under uncertainty | 2020-01-27 | Paper |
| Optimizing the pipeline planning system at the National Oil Company | 2019-04-23 | Paper |
| Risk management for forestry planning under uncertainty in demand and prices | 2018-05-30 | Paper |
| A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem | 2016-06-29 | Paper |
| Medium range optimization of copper extraction planning under uncertainty in future copper prices | 2016-06-24 | Paper |
| A branch-and-cluster coordination scheme for selecting prison facility sites under uncertainty | 2012-11-15 | Paper |
| Forestry management under uncertainty | 2012-03-08 | Paper |
| An homage to Joseph-Louis Lagrange and Pierre Huard | 2011-05-20 | Paper |
| Exact solution of emerging quadratic assignment problems | 2011-05-20 | Paper |
| Term-end exam scheduling at United States Military Academy/West Point | 2010-10-08 | Paper |
| Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique | 2010-06-11 | Paper |
| A Problem of Forest Harvesting and Road Building Solved Through Model Strengthening and Lagrangean Relaxation | 2009-07-09 | Paper |
| An algorithm for the generalized quadratic assignment problem | 2009-02-13 | Paper |
| The quadratic three-dimensional assignment problem: exact and approximate solution methods | 2007-10-10 | Paper |
| A level-2 reformulation-linearization technique bound for the quadratic assignment problem | 2007-03-27 | Paper |
| Logical processing for integer programming | 2006-03-07 | Paper |
| Hybridizing discrete- and continuous-time models for batch sizing and scheduling problems | 2005-11-01 | Paper |
| Lagrangean relaxation. (With comments and rejoinder). | 2004-09-07 | Paper |
| Scheduling deliveries in vehicles with multiple compartments | 2004-02-12 | Paper |
| Redefining event variables for efficient modeling of continuous-time batch processing | 2003-01-27 | Paper |
| Efficient cuts in Lagrangean `relax-and-cut' schemes | 2001-03-22 | Paper |
| Forest management models and combinatorial algorithms: Analysis of state of the art | 2001-01-17 | Paper |
| Model tightening for integrated timber harvest and transportation planning | 2000-06-27 | Paper |
| Polyhedral analysis and decompositions for capacitated plant location-type problems | 1998-10-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4368560 | 1998-01-15 | Paper |
| A Hybrid Bounding Procedure for the Workload Allocation Problem on Parallel Unrelated Machines with Setups | 1997-01-15 | Paper |
| Selection of Capacity Expansion Projects | 1996-04-29 | Paper |
| A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships | 1996-02-15 | Paper |
| Exact Algorithms For The Setup Knapsack Problem | 1994-11-29 | Paper |
| Studying the effects of production loss due to setup in dynamic production scheduling | 1994-11-13 | Paper |
| Dynamic Production Scheduling for a Process Industry | 1994-09-15 | Paper |
| Solving makespan minimization problems with Lagrangean decomposition | 1993-05-16 | Paper |
| Applying a modified coefficient reduction method to a dynamic production scheduling model | 1993-01-16 | Paper |
| An application of lagrangean decomposition to the resource-constrained minimum weighted arborescence problem | 1990-01-01 | Paper |
| Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems | 1990-01-01 | Paper |
| Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem | 1989-01-01 | Paper |
| An application-oriented guide for designing Lagrangean dual ascent algorithms | 1989-01-01 | Paper |
| A Lagrangean dual ascent algorithm for simple plant location problems | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3789340 | 1988-01-01 | Paper |
| Note—An Approximate Algorithm for Multidimensional Zero-One Knapsack Problems—A Parametric Approach | 1988-01-01 | Paper |
| Lagrangean decomposition: A model yielding stronger lagrangean bounds | 1987-01-01 | Paper |
| Lagrangean decomposition for integer programming : theory and applications | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4721865 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3741424 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3678971 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3220311 | 1984-01-01 | Paper |
| Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables | 1981-01-01 | Paper |
| Fractional vertices, cuts and facets of the simple plant location problem | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3869065 | 1980-01-01 | Paper |
| A direct dual method for the mixed plant location problem with some side constraints | 1979-01-01 | Paper |
| The Collapsing 0–1 Knapsack Problem | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3859563 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4138479 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4139968 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4096146 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5646677 | 1971-01-01 | Paper |
| Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space | 1969-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5545148 | 1968-01-01 | Paper |
