An homage to Joseph-Louis Lagrange and Pierre Huard
From MaRDI portal
Publication:537596
DOI10.1007/s10479-006-0111-yzbMath1213.01018OpenAlexW2042348405WikidataQ125994317 ScholiaQ125994317MaRDI QIDQ537596
Publication date: 20 May 2011
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-006-0111-y
History of operations research and mathematical programming (90-03) History of mathematics in the 17th century (01A45)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new presentation of the conjugate direction algorithm
- A transformation of hard (equality constrained) knapsack problems into constrained shortest path problems
- Layering strategies for creating exploitable structure in linear and integer programs
- Rehabilitation of the Gauss-Jordan algorithm
- Lagrangean decomposition for integer nonlinear programming with linear constraints
- Solving makespan minimization problems with Lagrangean decomposition
- Second- and higher-order duality in nonlinear programming
- Implementation of gradient methods by tangential discretization
- Method of centers for minimizing generalized eigenvalues
- Efficient cuts in Lagrangean `relax-and-cut' schemes
- The Gauss-Huard algorithm and LU factorization
- On modelling the maximum workload allocation for parallel unrelated machines with setups
- Parallel algorithms for solving large linear systems
- A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships
- Stability of the Gauss-Huard algorithm with partial pivoting
- Polyhedral analysis and decompositions for capacitated plant location-type problems
- Scheduling deliveries in vehicles with multiple compartments
- Model tightening for integrated timber harvest and transportation planning
- Analytic centers and repelling inequalities
- Lagrangean relaxation. (With comments and rejoinder).
- Huard type second-order converse duality for nonlinear programming
- La méthode des centres dans un espace topologique
- A Multiplier Adjustment Method for the Generalized Assignment Problem
- A direct dual method for the mixed plant location problem with some side constraints
- An application of lagrangean decomposition to the resource-constrained minimum weighted arborescence problem
- On the Guignard constraint qualification for mathematical programs with equilibrium constraints
- A Problem of Forest Harvesting and Road Building Solved Through Model Strengthening and Lagrangean Relaxation
- The Deterministic Dynamic Product Cycling Problem
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Lagrangean decomposition for integer programming : theory and applications
- Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
- A Dual-Based Procedure for Uncapacitated Facility Location
- A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem
- Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- The steepest-ascent method for the linear programming problem
- Lagrangean Decomposition In Integer Linear Programming: A New Scheme
- Optimization algorithms and point-to-set-maps
- Extensions of Zangwill’s theorem
- Composition and union of general algorithms of optimization
- Dynamic Production Scheduling for a Process Industry
- Exact Algorithms For The Setup Knapsack Problem
- A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
- Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
- A Necessary and Sufficient Qualification for Constrained Optimization
- The Traveling-Salesman Problem and Minimum Spanning Trees
- The traveling-salesman problem and minimum spanning trees: Part II
- Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
- A Hybrid Bounding Procedure for the Workload Allocation Problem on Parallel Unrelated Machines with Setups
- Dual Programs [Letter to the Editor]
- Parallel implementation of a central decomposition method for solving large-scale planning problems
