An homage to Joseph-Louis Lagrange and Pierre Huard

Cites work

scientific article; zbMATH DE number 4016031 (Why is no real title available?)
scientific article; zbMATH DE number 3932322 (Why is no real title available?)
scientific article; zbMATH DE number 3961370 (Why is no real title available?)
scientific article; zbMATH DE number 3976783 (Why is no real title available?)
scientific article; zbMATH DE number 3991288 (Why is no real title available?)
scientific article; zbMATH DE number 4053350 (Why is no real title available?)
scientific article; zbMATH DE number 3568354 (Why is no real title available?)
scientific article; zbMATH DE number 3614502 (Why is no real title available?)
scientific article; zbMATH DE number 3249567 (Why is no real title available?)
scientific article; zbMATH DE number 3253619 (Why is no real title available?)
scientific article; zbMATH DE number 3375248 (Why is no real title available?)
scientific article; zbMATH DE number 3400681 (Why is no real title available?)
scientific article; zbMATH DE number 3067835 (Why is no real title available?)
A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
A Dual-Based Procedure for Uncapacitated Facility Location
A Hybrid Bounding Procedure for the Workload Allocation Problem on Parallel Unrelated Machines with Setups
A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem
A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships
A Multiplier Adjustment Method for the Generalized Assignment Problem
A Necessary and Sufficient Qualification for Constrained Optimization
A Problem of Forest Harvesting and Road Building Solved Through Model Strengthening and Lagrangean Relaxation
A direct dual method for the mixed plant location problem with some side constraints
A new presentation of the conjugate direction algorithm
A transformation of hard (equality constrained) knapsack problems into constrained shortest path problems
An application of lagrangean decomposition to the resource-constrained minimum weighted arborescence problem
Analytic centers and repelling inequalities
Composition and union of general algorithms of optimization
Dual Programs [Letter to the Editor]
Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
Dynamic Production Scheduling for a Process Industry
Efficient cuts in Lagrangean `relax-and-cut' schemes
Exact Algorithms For The Setup Knapsack Problem
Extensions of Zangwill’s theorem
Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
Huard type second-order converse duality for nonlinear programming
Implementation of gradient methods by tangential discretization
La méthode des centres dans un espace topologique
Lagrangean Decomposition In Integer Linear Programming: A New Scheme
Lagrangean decomposition for integer nonlinear programming with linear constraints
Lagrangean decomposition for integer programming : theory and applications
Lagrangean decomposition: A model yielding stronger lagrangean bounds
Lagrangean relaxation. (With comments and rejoinder).
Layering strategies for creating exploitable structure in linear and integer programs
Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables
Method of centers for minimizing generalized eigenvalues
Model tightening for integrated timber harvest and transportation planning
On modelling the maximum workload allocation for parallel unrelated machines with setups
On the Guignard constraint qualification for mathematical programs with equilibrium constraints
Optimization algorithms and point-to-set-maps
Parallel algorithms for solving large linear systems
Parallel implementation of a central decomposition method for solving large-scale planning problems
Polyhedral analysis and decompositions for capacitated plant location-type problems
Rehabilitation of the Gauss-Jordan algorithm
Scheduling deliveries in vehicles with multiple compartments
Second- and higher-order duality in nonlinear programming
Solving makespan minimization problems with Lagrangean decomposition
Stability of the Gauss-Huard algorithm with partial pivoting
Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
The Deterministic Dynamic Product Cycling Problem
The Gauss-Huard algorithm and LU factorization
The Lagrangian Relaxation Method for Solving Integer Programming Problems
The Traveling-Salesman Problem and Minimum Spanning Trees
The steepest-ascent method for the linear programming problem
The traveling-salesman problem and minimum spanning trees: Part II

This page was built for publication: An homage to Joseph-Louis Lagrange and Pierre Huard

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q537596)