| Publication | Date of Publication | Type |
|---|
Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic 0-1 optimization problems with linear constraints
Annals of Operations Research | 2020-05-11 | Paper |
On dealing with strategic and tactical decision levels in forestry planning under uncertainty
Computers & Operations Research | 2020-01-27 | Paper |
Optimizing the pipeline planning system at the National Oil Company
European Journal of Operational Research | 2019-04-23 | Paper |
Risk management for forestry planning under uncertainty in demand and prices
European Journal of Operational Research | 2018-05-30 | Paper |
A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem
INFORMS Journal on Computing | 2016-06-29 | Paper |
Medium range optimization of copper extraction planning under uncertainty in future copper prices
European Journal of Operational Research | 2016-06-24 | Paper |
A branch-and-cluster coordination scheme for selecting prison facility sites under uncertainty
Computers & Operations Research | 2012-11-15 | Paper |
Forestry management under uncertainty
Annals of Operations Research | 2012-03-08 | Paper |
An homage to Joseph-Louis Lagrange and Pierre Huard
Annals of Operations Research | 2011-05-20 | Paper |
Exact solution of emerging quadratic assignment problems
International Transactions in Operational Research | 2011-05-20 | Paper |
Term-end exam scheduling at United States Military Academy/West Point
Journal of Scheduling | 2010-10-08 | Paper |
Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique
European Journal of Operational Research | 2010-06-11 | Paper |
A Problem of Forest Harvesting and Road Building Solved Through Model Strengthening and Lagrangean Relaxation
Operations Research | 2009-07-09 | Paper |
An algorithm for the generalized quadratic assignment problem
Computational Optimization and Applications | 2009-02-13 | Paper |
The quadratic three-dimensional assignment problem: exact and approximate solution methods
European Journal of Operational Research | 2007-10-10 | Paper |
A level-2 reformulation-linearization technique bound for the quadratic assignment problem
European Journal of Operational Research | 2007-03-27 | Paper |
Logical processing for integer programming
Annals of Operations Research | 2006-03-07 | Paper |
Hybridizing discrete- and continuous-time models for batch sizing and scheduling problems
Computers & Operations Research | 2005-11-01 | Paper |
Lagrangean relaxation. (With comments and rejoinder).
Top | 2004-09-07 | Paper |
Scheduling deliveries in vehicles with multiple compartments
Journal of Global Optimization | 2004-02-12 | Paper |
Redefining event variables for efficient modeling of continuous-time batch processing
Annals of Operations Research | 2003-01-27 | Paper |
Efficient cuts in Lagrangean `relax-and-cut' schemes
European Journal of Operational Research | 2001-03-22 | Paper |
Forest management models and combinatorial algorithms: Analysis of state of the art
Annals of Operations Research | 2001-01-17 | Paper |
Model tightening for integrated timber harvest and transportation planning
European Journal of Operational Research | 2000-06-27 | Paper |
Polyhedral analysis and decompositions for capacitated plant location-type problems
Discrete Applied Mathematics | 1998-10-26 | Paper |
| scientific article; zbMATH DE number 1094769 (Why is no real title available?) | 1998-01-15 | Paper |
A Hybrid Bounding Procedure for the Workload Allocation Problem on Parallel Unrelated Machines with Setups
The Journal of the Operational Research Society | 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
Annals of Operations Research | 1996-02-15 | Paper |
Exact Algorithms For The Setup Knapsack Problem
INFOR: Information Systems and Operational Research | 1994-11-29 | Paper |
Studying the effects of production loss due to setup in dynamic production scheduling
European Journal of Operational Research | 1994-11-13 | Paper |
Dynamic Production Scheduling for a Process Industry
Operations Research | 1994-09-15 | Paper |
Solving makespan minimization problems with Lagrangean decomposition
Discrete Applied Mathematics | 1993-05-16 | Paper |
Applying a modified coefficient reduction method to a dynamic production scheduling model
European Journal of Operational Research | 1993-01-16 | Paper |
An application of lagrangean decomposition to the resource-constrained minimum weighted arborescence problem
Networks | 1990-01-01 | Paper |
Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems
European Journal of Operational Research | 1990-01-01 | Paper |
Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
Operations Research | 1989-01-01 | Paper |
An application-oriented guide for designing Lagrangean dual ascent algorithms
European Journal of Operational Research | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4053350 (Why is no real title available?) | 1988-01-01 | Paper |
A Lagrangean dual ascent algorithm for simple plant location problems
European Journal of Operational Research | 1988-01-01 | Paper |
Note—An Approximate Algorithm for Multidimensional Zero-One Knapsack Problems—A Parametric Approach
Management Science | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 3993306 (Why is no real title available?) | 1987-01-01 | Paper |
Lagrangean decomposition: A model yielding stronger lagrangean bounds
Mathematical Programming | 1987-01-01 | Paper |
Lagrangean decomposition for integer programming : theory and applications
RAIRO - Operations Research | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3976783 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3900505 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3885614 (Why is no real title available?) | 1984-01-01 | Paper |
Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables
Operations Research | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3671992 (Why is no real title available?) | 1980-01-01 | Paper |
Fractional vertices, cuts and facets of the simple plant location problem
Mathematical Programming Studies | 1980-01-01 | Paper |
A direct dual method for the mixed plant location problem with some side constraints
Mathematical Programming | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3661100 (Why is no real title available?) | 1978-01-01 | Paper |
The Collapsing 0–1 Knapsack Problem
Mathematical Programming | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3566547 (Why is no real title available?) | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3568355 (Why is no real title available?) | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3516922 (Why is no real title available?) | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3375248 (Why is no real title available?) | 1971-01-01 | Paper |
Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
SIAM Journal on Control | 1969-01-01 | Paper |
| scientific article; zbMATH DE number 3257009 (Why is no real title available?) | 1968-01-01 | Paper |
