The Lagrangian Relaxation Method for Solving Integer Programming Problems
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Convergent Lagrangian and domain cut method for nonlinear knapsack problems
- An exact algorithm for the fixed-charge multiple knapsack problem
- Developing work schedules for an inter-city transit system with multiple driver types and fleet types
- The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs
- A Lagrangian relaxation approach to large-scale flow interception problems
- A new Lagrangean approach to the pooling problem
- Resource-constrained management of heterogeneous assets with stochastic deterioration
- A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times
- A comparison of two dual-based procedures for solving the p-median problem
- A note on solving large p-median problems
- Capital budgeting with Benders' decomposition
- ASEAN industrial cooperation: The case of multi-product capacity expansion
- 'Multidimensional' extensions and a nested dual approach for the m-median problem
- Some computational results on real 0-1 knapsack problems
- Experimentation in optimization
- Implementation techniques for the vehicle routing problem
- A Lagrangean relaxation method for the constrained assignment problem
- A new Lagrangian relaxation approach to the generalized assignment problem
- A computational evaluation of two subgradient search methods
- Lagrangean relaxation for a lower bound to a set partitioning problem with side constraints: Properties and algorithms
- Hierarchical approach to the process planning problem
- An algorithm for solving large capacitated warehouse location problems
- Surrogate duality in a branch-and-bound procedure for integer programming
- A large-scale multilocation capacity planning model
- A shadow price in integer programming for management decision
- Maximal chordal subgraphs
- An improved direct descent algorithm for binary knapsack problems
- Application of Lagrangian relaxation to computer network control
- A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems
- Lagrangian dual ascent by generalized linear programming
- Design of electronic assembly lines: An analytical framework and its application
- The scheduling problem where multiple machines compete for a common local buffer
- A fixed interval due-date scheduling problem with earliness and due-date costs
- An integrated model for the development of marginal water sources in the Negev Desert
- A heuristic decomposition approach to optimal control in a water supply model
- An algorithm for single machine sequencing with deadlines to minimize total weighted completion time
- Surrogate duality relaxation for job shop scheduling
- The design of multiactivity multifacility systems
- Locational analysis
- The hierarchical network design problem with transshipment facilities
- Lagrangean decomposition for integer nonlinear programming with linear constraints
- A solution procedure for the file allocation problem with file availability and response time
- The \(K\)-coverage concentrator location problem
- Flow network design for manufacturing systems layout
- Integrating facility layout with process selection and capacity planning
- Configuration of fully replicated distributed database system over wide area networks
- Locating concentrators in centralized computer networks
- Relaxations for probabilistically constrained programs with discrete random variables
- A matching-based approach for solving a delivery/pick-up vehicle routing problem with time constraints
- Capacitated lot-sizing and scheduling by Lagrangean relaxation
- A survey of algorithms for the generalized assignment problem
- Scheduling examinations to reduce second-order conflicts
- Lagrangian approach for large-scale least absolute value estimation
- A decomposition technique for mixed integer programming problems
- A scheduling model for the daily operation of an electric power system
- An integrated approach to the part selection and machine loading problem in a class of flexible manufacturing systems
- File allocation involving worst case response times and link capacities: Model and solution procedure
- A due date assignment algorithm for multiproduct manufacturing facilities
- A survey of algorithms for the single machine total weighted tardiness scheduling problem
- Facilities location in a competitive environment: A Promethee based multiple criteria analysis
- Resource constrained assignment problems
- Partial termination rule of Lagrangian relaxation for manufacturing cell formation problems
- Conditional subgradient optimization -- theory and applications
- An adaptation of SH heuristic to the location set covering problem
- Relaxation heuristics for a generalized assignment problem
- A tree search algorithm for the crew scheduling problem
- Air cargo revenue management: Characteristics and complexities
- Single machine earliness and tardiness scheduling
- A fuzzy programming approach to multiobjective multidimensional 0-1 knapsack problems
- Multifleet routing and multistop flight scheduling for schedule perturbation
- Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem
- A constrained nonlinear 0-1 program for data allocation
- Capacity planning for phased implementation of flexible manufacturing systems under budget restrictions
- Lower bounding techniques for frequency assignment
- A hybrid genetic/optimization algorithm for a task allocation problem
- Algorithms for a multi-level network optimization problem
- Application of the scenario aggregation approach to a two-stage, stochastic, common component, inventory problem with a budget constraint
- Cellular control of manufacturing systems
- A technique for speeding up the solution of the Lagrangean dual
- Inexact subgradient methods with applications in stochastic programming
- Experiments with parallel branch-and-bound algorithms for the set covering problem
- Scheduling identical parallel machines to minimize total weighted completion time
- Analyzing tradeoffs between zonal constraints and accessibility in facility location
- Studying the effects of production loss due to setup in dynamic production scheduling
- Topological design of a centralized communication network with unreliable links and node outage costs
- An algorithm for the planar three-index assignment problem
- Application of facility location modeling constructs to vendor selection problems
- Production allocation with dual provisioning
- Probabilistic properties of the dual structure of the multidimensional knapsack problem and fast statistically efficient algorithms
- Comparison of formulations and a heuristic for packing Steiner trees in a graph
- Multiple-type, two-dimensional bin packing problems: Applications and algorithms
- Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem
- Multi-item capacitated lot-sizing by a cross decomposition based algorithm
- A column generation approach to job grouping for flexible manufacturing systems
- New heuristic solution procedures for the uniform graph partitioning problem: Extensions and evaluation
- Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
- Algorithms for railway crew management
- Solving large set covering problems for crew scheduling
- A heuristic method for lot-sizing in multi-stage systems
- Solving the anti-covering location problem using Lagrangian relaxation
This page was built for publication: The Lagrangian Relaxation Method for Solving Integer Programming Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3919449)
