The following pages link to Monique Guignard (Q297024):
Displayed 50 items.
- Medium range optimization of copper extraction planning under uncertainty in future copper prices (Q297027) (← links)
- An homage to Joseph-Louis Lagrange and Pierre Huard (Q537596) (← links)
- Forestry management under uncertainty (Q666469) (← links)
- Term-end exam scheduling at United States Military Academy/West Point (Q707689) (← links)
- Logical processing for integer programming (Q817209) (← links)
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem (Q872113) (← links)
- A Lagrangean dual ascent algorithm for simple plant location problems (Q911446) (← links)
- Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique (Q976396) (← links)
- An algorithm for the generalized quadratic assignment problem (Q1001198) (← links)
- Applying a modified coefficient reduction method to a dynamic production scheduling model (Q1197923) (← links)
- Solving makespan minimization problems with Lagrangean decomposition (Q1209146) (← links)
- Efficient cuts in Lagrangean `relax-and-cut' schemes (Q1291724) (← links)
- Studying the effects of production loss due to setup in dynamic production scheduling (Q1319562) (← links)
- A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships (Q1339126) (← links)
- Polyhedral analysis and decompositions for capacitated plant location-type problems (Q1383369) (← links)
- Scheduling deliveries in vehicles with multiple compartments (Q1422874) (← links)
- Forest management models and combinatorial algorithms: Analysis of state of the art (Q1593541) (← links)
- Optimizing the pipeline planning system at the National Oil Company (Q1737519) (← links)
- Risk management for forestry planning under uncertainty in demand and prices (Q1754283) (← links)
- A branch-and-cluster coordination scheme for selecting prison facility sites under uncertainty (Q1761157) (← links)
- Model tightening for integrated timber harvest and transportation planning (Q1806856) (← links)
- An application-oriented guide for designing Lagrangean dual ascent algorithms (Q1824554) (← links)
- Redefining event variables for efficient modeling of continuous-time batch processing (Q1854778) (← links)
- Lagrangean relaxation. (With comments and rejoinder). (Q1876461) (← links)
- Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic \(0-1\) optimization problems with linear constraints (Q2178343) (← links)
- On dealing with strategic and tactical decision levels in forestry planning under uncertainty (Q2289912) (← links)
- The quadratic three-dimensional assignment problem: exact and approximate solution methods (Q2384611) (← links)
- Hybridizing discrete- and continuous-time models for batch sizing and scheduling problems (Q2571190) (← links)
- Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems (Q2640440) (← links)
- A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem (Q2815440) (← links)
- Exact solution of emerging quadratic assignment problems (Q3002542) (← links)
- A direct dual method for the mixed plant location problem with some side constraints (Q3206665) (← links)
- (Q3220311) (← links)
- An application of lagrangean decomposition to the resource-constrained minimum weighted arborescence problem (Q3479809) (← links)
- A Problem of Forest Harvesting and Road Building Solved Through Model Strengthening and Lagrangean Relaxation (Q3637375) (← links)
- (Q3678971) (← links)
- (Q3741424) (← links)
- Note—An Approximate Algorithm for Multidimensional Zero-One Knapsack Problems—A Parametric Approach (Q3780001) (← links)
- Lagrangean decomposition: A model yielding stronger lagrangean bounds (Q3780005) (← links)
- Lagrangean decomposition for integer programming : theory and applications (Q3780006) (← links)
- (Q3789340) (← links)
- Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem (Q3829355) (← links)
- (Q3859563) (← links)
- (Q3869065) (← links)
- Fractional vertices, cuts and facets of the simple plant location problem (Q3882190) (← links)
- Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables (Q3899820) (← links)
- (Q4096146) (← links)
- (Q4138479) (← links)
- (Q4139968) (← links)
- The Collapsing 0–1 Knapsack Problem (Q4175049) (← links)