Pages that link to "Item:Q4198339"

The following pages link to A Survey of Lagrangean Techniques for Discrete Optimization (Q4198339):

Displaying 47 items.

• Use of Lagrangian decomposition in supply chain planning (Q409926) (← links)
• A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Q439503) (← links)
• Lagrangian heuristic for a class of the generalized assignment problems (Q611434) (← links)
• Multi-level multi-item lot size planning with limited resources and general manufacturing structure. (Q684381) (← links)
• Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs (Q691415) (← links)
• Large-scale mixed integer programming: Benders-type heuristics (Q789322) (← links)
• A heuristic lagrangean algorithm for the capacitated plant location problem (Q797475) (← links)
• Solving capacitated clustering problems (Q799059) (← links)
• A multiple objective interactive Lagrangean relaxation approach (Q800836) (← links)
• Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method (Q946351) (← links)
• A Lagrangian bound for many-to-many assignment problems (Q975754) (← links)
• Convergent Lagrangian and domain cut method for nonlinear knapsack problems (Q1001200) (← links)
• An optimisation-oriented model of distributed supply-chain (Q1010005) (← links)
• Capital budgeting with Benders' decomposition (Q1062887) (← links)
• Lagrangean relaxation and decomposition in an uncapacitated 2-hierarchal location-allocation problem (Q1086126) (← links)
• Hierarchical approach to the process planning problem (Q1097828) (← links)
• Maximal chordal subgraphs (Q1115455) (← links)
• Application of Lagrangian relaxation to computer network control (Q1118382) (← links)
• A heuristic decomposition approach to optimal control in a water supply model (Q1167069) (← links)
• A Langrangean heuristic for the \(p_ k\)-median dynamic location problem (Q1194737) (← links)
• Capacitated lot-sizing and scheduling by Lagrangean relaxation (Q1198326) (← links)
• A decomposition technique for mixed integer programming problems (Q1206388) (← links)
• An interactive procedure for multiple objective integer linear programming problems (Q1309911) (← links)
• Cellular control of manufacturing systems (Q1309976) (← links)
• The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm (Q1318275) (← links)
• State space relaxation for set covering problems related to bus driver scheduling (Q1322157) (← links)
• Probabilistic properties of the dual structure of the multidimensional knapsack problem and fast statistically efficient algorithms (Q1338142) (← links)
• An exact method for the two-echelon, single-source, capacitated facility location problem (Q1572966) (← links)
• The simple plant location problem: Survey and synthesis (Q1837098) (← links)
• A nonlinear Lagrangian dual for integer programming (Q1870020) (← links)
• Lagrangean relaxation. (With comments and rejoinder). (Q1876461) (← links)
• Dynamic Lagrangian dual and reduced RLT constructs for solving \(0-1\) mixed-integer programs (Q1935886) (← links)
• Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes (Q1972019) (← links)
• Studying properties of Lagrangian bounds for many-to-many assignment problems (Q2017507) (← links)
• Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop (Q2044553) (← links)
• Stochastic facility location with general long-run costs and convex short-run costs (Q2475855) (← links)
• Towards strong duality in integer programming (Q2501114) (← links)
• Generalized nonlinear Lagrangian formulation for bounded integer programming (Q2583181) (← links)
• Distance confined path problem and separable integer programming (Q2841138) (← links)
• On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms (Q2944569) (← links)
• A new exchange property for matroids and its application to max-min-problems (Q3342227) (← links)
• Effective Algorithms for a Class of Discrete Valued Optimal Control Problems (Q3589728) (← links)
• Combinatorial Heuristics for Inventory Routing Problems (Q5084657) (← links)
• Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems (Q5506732) (← links)
• A modified subgradient algorithm for Lagrangean relaxation (Q5926608) (← links)
• Refinement of Lagrangian bounds in optimization problems (Q6122370) (← links)
• Feasibility jump: an LP-free Lagrangian MIP heuristic (Q6175707) (← links)