The following pages link to (Q4178782):
Displaying 50 items.
- A decomposition method for large scale MILPs, with performance guarantees and a power system application (Q259426) (← links)
- Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem (Q263164) (← links)
- A two-level approach to large mixed-integer programs with application to cogeneration in energy-efficient buildings (Q316165) (← links)
- A branch-cut-and-price algorithm for the piecewise linear transportation problem (Q319653) (← links)
- Lagrangean relaxation of the hull-reformulation of linear generalized disjunctive programs and its use in disjunctive branch and bound (Q323168) (← links)
- Scenario cluster decomposition of the Lagrangian dual in two-stage stochastic mixed 0-1 optimization (Q339591) (← links)
- Cluster Lagrangean decomposition in multistage stochastic optimization (Q342253) (← links)
- Solving a dynamic facility location problem with partial closing and reopening (Q342268) (← links)
- Improving problem reduction for 0-1 multidimensional knapsack problems with valid inequalities (Q342340) (← links)
- Multiperiod optimal planning of thermal generation using cross decomposition (Q353701) (← 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)
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Q439503) (← links)
- Stochastic dual dynamic programming applied to nonconvex hydrothermal models (Q439570) (← links)
- The traveling salesman problem with flexible coloring (Q444446) (← links)
- Optimization methods for mixed integer weakly concave programming problems (Q489113) (← links)
- Exact augmented Lagrangian duality for mixed integer linear programming (Q507329) (← links)
- Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems (Q526828) (← links)
- A reduction approach to the repeated assignment problem (Q531433) (← links)
- Hub location-allocation in intermodal logistic networks (Q531438) (← links)
- An homage to Joseph-Louis Lagrange and Pierre Huard (Q537596) (← links)
- A Benders decomposition based heuristic for the hierarchical production planning problem (Q584066) (← links)
- Solving network manpower problems with side constraints (Q595507) (← links)
- Multiple machine continuous setup lotsizing with sequence-dependent setups (Q616801) (← links)
- The combinatorial bandwidth packing problem (Q621657) (← links)
- Branching in branch-and-price: A generic scheme (Q652288) (← links)
- Using conical regularization in calculating Lagrangian estimates in quadratic optimization problems (Q681722) (← links)
- The convex hull of two core capacitated network design problems (Q689128) (← links)
- Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search (Q706997) (← links)
- A critical review of discrete filled function methods in solving nonlinear discrete optimization problems (Q708127) (← links)
- On efficient matheuristic algorithms for multi-period stochastic facility location-assignment problems (Q721958) (← links)
- A branch and bound algorithm for solving the multiple-choice knapsack problem (Q760766) (← links)
- A heuristic algorithm for the multidimensional zero-one knapsack problem (Q789318) (← links)
- Large-scale mixed integer programming: Benders-type heuristics (Q789322) (← links)
- A heuristic lagrangean algorithm for the capacitated plant location problem (Q797475) (← links)
- A multiple objective interactive Lagrangean relaxation approach (Q800836) (← links)
- A facet generation and relaxation technique applied to an assignment problem with side constraints (Q810374) (← links)
- A comparison of heuristics and relaxations for the capacitated plant location problem (Q811347) (← links)
- Modelling a fertiliser distribution system (Q811356) (← links)
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- Tight bounds from a path based formulation for the tree of hub location problem (Q833527) (← links)
- A comparison of five heuristics for the multiple depot vehicle scheduling problem (Q835636) (← links)
- On solving the Lagrangian dual of integer programs via an incremental approach (Q849073) (← links)
- The TV-break packing problem (Q853012) (← links)
- An enhanced dynamic slope scaling procedure with tabu scheme for fixed charge network flow problems (Q853587) (← links)
- Solving the \(p\)-median problem with a semi-Lagrangian relaxation (Q853887) (← links)
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (Q857326) (← links)
- Exploiting nested inequalities and surrogate constraints (Q858413) (← links)
- Lower bounds for the two-stage uncapacitated facility location problem (Q864032) (← links)
- The quadratic knapsack problem -- a survey (Q875597) (← links)
