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.
- On embedding the volume algorithm in a variable target value method. (Q703259) (← links)
- Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search (Q706997) (← links)
- Hub-and-spoke network design and fleet deployment for string planning of liner shipping (Q727347) (← links)
- Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory (Q747754) (← links)
- An optimization model and a solution algorithm for the many-to-many car pooling problem (Q763101) (← links)
- A heuristic lagrangean algorithm for the capacitated plant location problem (Q797475) (← links)
- Solving capacitated clustering problems (Q799059) (← links)
- Modelling a fertiliser distribution system (Q811356) (← links)
- Optimal planning of a multi-station system with sojourn time constraints (Q817147) (← links)
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- Airline crew scheduling: state-of-the-art (Q817210) (← links)
- Non delayed relax-and-cut algorithms (Q817212) (← links)
- On solving the Lagrangian dual of integer programs via an incremental approach (Q849073) (← links)
- Convergence and computational analyses for some variable target value and subgradient deflection methods (Q853561) (← links)
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (Q857326) (← links)
- A trust region target value method for optimizing nondifferentiable Lagrangian duals of linear programs (Q857822) (← links)
- Exploiting nested inequalities and surrogate constraints (Q858413) (← links)
- The stochastic location model with risk pooling (Q864042) (← links)
- A matrix generation approach for eigenvalue optimization (Q868452) (← links)
- Short-term work scheduling with job assignment flexibility for a multi-fleet transport system (Q869153) (← links)
- On ascending Vickrey auctions for heterogeneous objects (Q869853) (← links)
- A hop constrained min-sum arborescence with outage costs (Q875410) (← links)
- The quadratic knapsack problem -- a survey (Q875597) (← links)
- Discrete global descent method for discrete global optimization and nonlinear integer programming (Q878221) (← links)
- Lagrangian relaxation guided problem space search heuristics for generalized assignment problems (Q884028) (← links)
- Discrete global optimization problems with a modified discrete filled function (Q888308) (← links)
- The equity constrained shortest path problem (Q910348) (← links)
- Time-axis decomposition of large-scale optimal control problems (Q911044) (← links)
- A dual ascent algorithm for the 1-tree relaxation of the symmetric traveling salesman problem (Q911484) (← links)
- Multi-level production scheduling for a class of flexible machining and assembly systems (Q918393) (← links)
- The capacitated maximal covering location problem with backup service (Q920016) (← links)
- A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures (Q933795) (← links)
- A decomposition-based pricing method for solving a large-scale MILP model for an integrated fishery (Q933875) (← links)
- Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method (Q946351) (← links)
- Optimal partitioning of a data set based on the \(p\)-median model (Q946677) (← links)
- Integration of strategic and tactical decisions for vendor selection under capacity constraints (Q991379) (← links)
- Convergent Lagrangian and domain cut method for nonlinear knapsack problems (Q1001200) (← links)
- An exact algorithm for the fixed-charge multiple knapsack problem (Q1011207) (← links)
- Developing work schedules for an inter-city transit system with multiple driver types and fleet types (Q1011229) (← links)
- The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs (Q1025236) (← links)
- A Lagrangian relaxation approach to large-scale flow interception problems (Q1026763) (← links)
- A new Lagrangean approach to the pooling problem (Q1037357) (← links)
- Resource-constrained management of heterogeneous assets with stochastic deterioration (Q1042122) (← links)
- A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times (Q1046712) (← links)
- A comparison of two dual-based procedures for solving the p-median problem (Q1058960) (← links)
- A note on solving large p-median problems (Q1060943) (← links)
- Capital budgeting with Benders' decomposition (Q1062887) (← links)
- ASEAN industrial cooperation: The case of multi-product capacity expansion (Q1064970) (← links)
- 'Multidimensional' extensions and a nested dual approach for the m-median problem (Q1072925) (← links)
- Some computational results on real 0-1 knapsack problems (Q1079123) (← links)