Pages that link to "Item:Q1876461"

The following pages link to Lagrangean relaxation. (With comments and rejoinder). (Q1876461):

Displaying 48 items.

• An application-oriented guide for designing Lagrangean dual ascent algorithms (Q1824554) (← links)
• Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies (Q1919186) (← links)
• Some heuristic methods for solving \(p\)-median problems with a coverage constraint (Q1926741) (← links)
• Lagrangian decomposition for large-scale two-stage stochastic mixed 0-1 problems (Q1939073) (← links)
• Fixed cardinality stable sets (Q1983123) (← links)
• The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time (Q1991101) (← links)
• A finite \(\epsilon\)-convergence algorithm for two-stage stochastic convex nonlinear programs with mixed-binary first and second-stage variables (Q2010099) (← links)
• Studying properties of Lagrangian bounds for many-to-many assignment problems (Q2017507) (← links)
• Management of wind power variations in electricity system investment models. A parallel computing strategy (Q2033401) (← links)
• Branch-and-price for a class of nonconvex mixed-integer nonlinear programs (Q2052398) (← links)
• On the complexity of surrogate and group relaxation for integer linear programs (Q2060595) (← links)
• A feasibility-ensured Lagrangian heuristic for general decomposable problems (Q2068837) (← links)
• An efficient optimisation procedure for the workforce scheduling and routing problem: Lagrangian relaxation and iterated local search (Q2147119) (← links)
• Stochastic hub location problems with Bernoulli demands (Q2147142) (← links)
• A Lagrangian relaxation algorithm for optimizing a bi-objective agro-supply chain model considering CO\(_2\) emissions (Q2159536) (← links)
• Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic \(0-1\) optimization problems with linear constraints (Q2178343) (← links)
• Integrated hub location and flow processing schedule problem under renewable capacity constraint (Q2244988) (← links)
• A dual bounding scheme for a territory design problem (Q2257364) (← links)
• An application of a Lagrangian-type relaxation for the uncapacitated facility location problem (Q2257610) (← links)
• Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems (Q2267294) (← links)
• Benders decomposition, Lagrangean relaxation and metaheuristic design (Q2271124) (← links)
• Train timetabling for an urban rail transit line using a Lagrangian relaxation approach (Q2281738) (← links)
• A Lagrangian relaxation approach for stochastic network capacity expansion with budget constraints (Q2288988) (← links)
• Lagrangian relaxation of the generic materials and operations planning model (Q2303321) (← links)
• Large-scale unit commitment under uncertainty (Q2351161) (← links)
• A Lagrangean decomposition for the maximum independent set problem applied to map labeling (Q2359523) (← links)
• Calculating the best dual bound for problems with multiple Lagrangian relaxations (Q2391512) (← links)
• Step fixed-charge solid transportation problem: a Lagrangian relaxation heuristic approach (Q2403107) (← links)
• Computation of approximate \(\alpha \)-points for large scale single machine scheduling problem (Q2482376) (← links)
• Decomposition and dynamic cut generation in integer linear programming (Q2490337) (← links)
• New approaches for optimizing over the semimetric polytope (Q2576727) (← links)
• Optimizing production capacity and safety stocks in general acyclic supply chains (Q2664281) (← links)
• A Lagrangian Relaxation-Based Heuristic to Solve Large Extended Graph Partitioning Problems (Q2803836) (← links)
• Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem (Q3458834) (← links)
• Lagrangean‐based solution approaches for the generalized problem of locating capacitated warehouses (Q3502137) (← links)
• Modeling and Managing Uncertainty in Process Planning and Scheduling (Q3638500) (← links)
• Using Surrogate Constraints in a Lagrangian Relaxation Approach to Set-Covering Problems (Q3786281) (← links)
• (Q4368560) (← links)
• Consistency Cuts for Dantzig-Wolfe Reformulations (Q5058051) (← links)
• The omnipresence of Lagrange (Q5920487) (← links)
• Matheuristics: survey and synthesis (Q6056873) (← links)
• Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem (Q6091422) (← links)
• Polyhedral results and stronger Lagrangean bounds for stable spanning trees (Q6110626) (← links)
• A Lagrangian heuristics for balancing the average weighted completion times of two classes of jobs in a single-machine scheduling problem (Q6114936) (← links)
• Refinement of Lagrangian bounds in optimization problems (Q6122370) (← links)
• A Decomposition Algorithm for Two-Stage Stochastic Programs with Nonconvex Recourse Functions (Q6188504) (← links)
• A Lagrangian relaxation approach to an electricity system investment model with a high temporal resolution (Q6201541) (← links)
• Towards global solutions for nonconvex two-stage stochastic programs: a polynomial lower approximation approach (Q6622759) (← links)