Pages that link to "Item:Q3919449"
From MaRDI portal
The following pages link to The Lagrangian Relaxation Method for Solving Integer Programming Problems (Q3919449):
Displaying 50 items.
- A multiperiod min-sum arborescence problem (Q260662) (← links)
- A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems (Q291046) (← links)
- An implicit enumeration algorithm for the passenger service planning problem: application to the Taiwan railways administration line (Q296903) (← links)
- Exact algorithms for single-machine scheduling with time windows and precedence constraints (Q310349) (← links)
- A two-level approach to large mixed-integer programs with application to cogeneration in energy-efficient buildings (Q316165) (← links)
- Two exact algorithms for the traveling umpire problem (Q319246) (← links)
- A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem (Q319274) (← links)
- Decomposition based hybrid metaheuristics (Q319285) (← links)
- Practical solutions for a dock assignment problem with trailer transportation (Q319870) (← links)
- Models and algorithms for network reduction (Q320811) (← links)
- Enhanced models and improved solution for competitive biofuel supply chain design under land use constraints (Q320925) (← links)
- Combinatorial Benders cuts for decomposing IMRT fluence maps using rectangular apertures (Q336468) (← links)
- The production routing problem: a review of formulations and solution algorithms (Q337418) (← links)
- Incorporating location, inventory and price decisions into a supply chain distribution network design problem (Q337462) (← links)
- Combining simulated annealing with Lagrangian relaxation and weighted Dantzig-Wolfe decomposition for integrated design decisions in wireless sensor networks (Q337548) (← links)
- An improved Lagrangian relaxation-based heuristic for a joint location-inventory problem (Q337612) (← links)
- Local search heuristics for the mobile facility location problem (Q337654) (← links)
- Heuristics for the multi-item capacitated lot-sizing problem with lost sales (Q339577) (← links)
- A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem (Q339653) (← links)
- A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times (Q342038) (← links)
- Improving problem reduction for 0-1 multidimensional knapsack problems with valid inequalities (Q342340) (← links)
- A Lagrangian heuristic algorithm for a public healthcare facility location problem (Q363567) (← links)
- A hybrid approach of bundle and Benders applied large mixed linear integer problem (Q364462) (← links)
- Use of Lagrangian decomposition in supply chain planning (Q409926) (← links)
- Resource leveling in a machine environment (Q418090) (← links)
- Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem (Q421467) (← links)
- A coordinated location-inventory model (Q439409) (← links)
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Q439503) (← links)
- The traveling salesman problem with flexible coloring (Q444446) (← links)
- Tailored Lagrangian relaxation for the open pit block sequencing problem (Q490234) (← links)
- The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm (Q496663) (← links)
- A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints (Q513546) (← links)
- Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems (Q526828) (← links)
- Hub location-allocation in intermodal logistic networks (Q531438) (← links)
- An homage to Joseph-Louis Lagrange and Pierre Huard (Q537596) (← links)
- An algorithm for a separable integer programming problem with cumulatively bounded variables (Q579126) (← links)
- A Lagrangean dual-based solution method for a special linear programming problem (Q581236) (← links)
- On an optimization problem with nested constraints (Q583110) (← links)
- A Benders decomposition based heuristic for the hierarchical production planning problem (Q584066) (← links)
- Solving network manpower problems with side constraints (Q595507) (← links)
- Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach (Q604257) (← links)
- The combinatorial bandwidth packing problem (Q621657) (← links)
- Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs (Q662860) (← links)
- Weighted search in the plane (Q673472) (← links)
- An efficient algorithm for the Lagrangean dual of nonlinear knapsack problems with additional nested constraints (Q675985) (← links)
- Multi-level multi-item lot size planning with limited resources and general manufacturing structure. (Q684381) (← links)
- Capacitated emergency facility siting with multiple levels of backup (Q689256) (← links)
- Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs (Q691415) (← links)
- A sliding time window heuristic for open pit mine block sequencing (Q691428) (← links)
- New Lagrangian relaxation based algorithm for resource scheduling with homogeneous subproblems (Q700701) (← links)
