The Lagrangian Relaxation Method for Solving Integer Programming Problems
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Steel-making process scheduling using Lagrangian relaxation
- Locating concentrators in centralized computer networks
- An integrated model for the production planning and the allocation of locations to items in a warehouse
- Solving the facility location and fixed charge solid transportation problem
- Topology optimization via sequential integer programming and canonical relaxation algorithm
- Impact analysis of maritime cabotage legislations on liner hub-and-spoke shipping network design
- Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search
- Steiner problem in networks: A survey
- A computational evaluation of two subgradient search methods
- An linear programming based lower bound for the simple assembly line balancing problem
- A constrained nonlinear 0-1 program for data allocation
- The scheduling problem where multiple machines compete for a common local buffer
- Multi-level multi-item lot size planning with limited resources and general manufacturing structure.
- An integrated approach to the part selection and machine loading problem in a class of flexible manufacturing systems
- Partial termination rule of Lagrangian relaxation for manufacturing cell formation problems
- A multiperiod min-sum arborescence problem
- An homage to Joseph-Louis Lagrange and Pierre Huard
- A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows
- Linear programming and Lagrangian relaxation heuristics for designing a material flow network on a block layout
- A statistical approach to adaptive problem solving
- Probabilistic properties of the dual structure of the multidimensional knapsack problem and fast statistically efficient algorithms
- Integrated Stochastic Optimal Self-Scheduling for Two-Settlement Electricity Markets
- Lower and upper bounds for a two-level hierarchical location problem in computer networks
- Computation of approximate -points for large scale single machine scheduling problem
- ATM network design for corporate networks
- On the strength of Lagrangian duality in multiobjective integer programming
- Hierarchical approach to the process planning problem
- A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties
- A path relinking approach with ejection chains for the generalized assignment problem
- A coordinated location-inventory model
- The capacitated maximal covering location problem with backup service
- A branch and bound algorithm for a production scheduling problem in an assembly system under due date constraints
- Use of Lagrangian decomposition in supply chain planning
- On embedding the volume algorithm in a variable target value method.
- Evasive flow capture: a multi-period stochastic facility location problem with independent demand
- Optimal bandwidth allocation for bandwidth adaptation in wireless multimedia networks.
- New Lagrangian relaxation based algorithm for resource scheduling with homogeneous subproblems
- Efficient Learning of Interpretable Classification Rules
- A hierarchical approach for metal parts fabrication
- Hub location-allocation in intermodal logistic networks
- Real-world extensions to scheduling algorithms based on Lagrangian relaxation
- A trust region target value method for optimizing nondifferentiable Lagrangian duals of linear programs
- A fuzzy programming approach to multiobjective multidimensional 0-1 knapsack problems
- An efficient optimisation procedure for the workforce scheduling and routing problem: Lagrangian relaxation and iterated local search
- A Lagrangian-based algorithm for a combinatorial motion planning problem
- An improved direct descent algorithm for binary knapsack problems
- Experimentation in optimization
- A new Lagrangian relaxation approach to the generalized assignment problem
- A due date assignment algorithm for multiproduct manufacturing facilities
- Step fixed-charge solid transportation problem: a Lagrangian relaxation heuristic approach
- Reformulation of the support set selection problem in the logical analysis of data
- Asynchronous transfer mode networks with parallel links and multiple service classes
- An improved Lagrangian relaxation-based heuristic for a joint location-inventory problem
- The production routing problem: a review of formulations and solution algorithms
- A monotonic, dual-based bounding procedure for integer programs
- Alternate solution approaches for competitive hub location problems
- A matrix generation approach for eigenvalue optimization
- Lagrangian relaxations for multiple network alignment
- Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem
- Algorithmic expedients for the S-labeling problem
- A novel model for transfer synchronization in transit networks and a Lagrangian-based heuristic solution method
- Optimal partitioning of a data set based on the \(p\)-median model
- Sustainable agriculture supply chain network design considering water-energy-food nexus using queuing system: a hybrid robust possibilistic programming
- The multiple bottleneck transportation problem
- Lagrangean decomposition for integer nonlinear programming with linear constraints
- Solving TSP through the integration of OR and CP techniques
- The stochastic location model with risk pooling
- Learning to guide local search optimisation for routing problems
- Surrogate duality in a branch-and-bound procedure for integer programming
- Discrete global descent method for discrete global optimization and nonlinear integer programming
- Cross decomposition for mixed integer programming
- Application of Lagrangian relaxation to computer network control
- LP-based heuristics for the capacitated lot-sizing problem: The interaction of model formulation and solution algorithm
- A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs
- A survey of algorithms for the generalized assignment problem
- An algorithm for the planar three-index assignment problem
- Lagrangian heuristic for simultaneous subsidization and penalization: implementations on rooted travelling salesman games
- Using deep learning to extend the range of air pollution monitoring and forecasting
- Heuristic procedure neural networks for the CMST problem
- A heuristic method for lot-sizing in multi-stage systems
- Exploiting nested inequalities and surrogate constraints
- A SIMPLE LOWER BOUND FOR TOTAL COMPLETION TIME MINIMIZATION IN A TWO-MACHINE FLOWSHOP
- An algorithm for solving large capacitated warehouse location problems
- Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem
- A hybrid algorithm for solving network flow problems with side constraints.
- A modified subgradient algorithm for Lagrangean relaxation
- A Lagrangean relaxation method for the constrained assignment problem
- Capacity planning with congestion effects
- A column generation approach to job grouping for flexible manufacturing systems
- Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach
- Design of a degree-constrained minimal spanning tree with unreliable links and node outage costs.
- Lagrangian dual ascent by generalized linear programming
- A fixed interval due-date scheduling problem with earliness and due-date costs
- Algorithms for a multi-level network optimization problem
- Supply capacity acquisition and allocation with uncertain customer demands
- A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems
- A multi-item approach to repairable stocking and expediting in a fluctuating demand environment
- Facilities location in a competitive environment: A Promethee based multiple criteria analysis
- Decomposition methods for the two-stage stochastic Steiner tree problem
- A feasibility-ensured Lagrangian heuristic for general decomposable problems
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)
