The following pages link to (Q4133397):
Displaying 50 items.
- Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem (Q337245) (← links)
- Hybrid methods for lot sizing on parallel machines (Q342050) (← links)
- Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines (Q490153) (← links)
- Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs (Q691415) (← links)
- Heuristically guided algorithm for k-parity matroid problems (Q754224) (← links)
- Convergence of a generalized subgradient method for nondifferentiable convex optimization (Q757242) (← links)
- Ein Subgradientenverfahren zur Klassifikation qualitativer Daten (Q761244) (← links)
- About Lagrangian methods in integer optimization (Q817183) (← links)
- An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual (Q817197) (← links)
- Convergence and computational analyses for some variable target value and subgradient deflection methods (Q853561) (← links)
- A trust region target value method for optimizing nondifferentiable Lagrangian duals of linear programs (Q857822) (← links)
- Incorporating inventory and routing costs in strategic location models (Q858450) (← links)
- Lagrangian relaxation guided problem space search heuristics for generalized assignment problems (Q884028) (← links)
- Optimization of R\&D project portfolios under endogenous uncertainty (Q992625) (← links)
- Heuristics for capacity planning problems with congestion (Q1000984) (← links)
- An effective heuristic for large-scale capacitated facility location problems (Q1044245) (← links)
- Heuristics and reduction methods for multiple constraints 0-1 linear programming problems (Q1067997) (← links)
- A computational evaluation of two subgradient search methods (Q1089257) (← links)
- Surrogate duality in a branch-and-bound procedure for integer programming (Q1099783) (← links)
- Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs (Q1110459) (← links)
- A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems (Q1122488) (← links)
- A network relaxation based enumeration algorithm for set partitioning (Q1123128) (← links)
- Solution of a tinned iron purchasing problem by Lagrangean relaxation (Q1130077) (← links)
- Ranking arborescences in O(Km log n) time (Q1142709) (← links)
- Variable target value subgradient method (Q1174455) (← links)
- Primal-dual approach to the single level capacitated lot-sizing problem (Q1178641) (← links)
- Topological design of wide area communication networks (Q1197802) (← links)
- The multicovering problem (Q1205691) (← links)
- The Min-Max Spanning Tree Problem and some extensions (Q1244239) (← links)
- Conditional subgradient optimization -- theory and applications (Q1266608) (← links)
- Enumeration approach for linear complementarity problems based on a reformulation-linearization technique (Q1275717) (← links)
- Multifleet routing and multistop flight scheduling for schedule perturbation (Q1280131) (← links)
- Orthogonalizing linear operators in convex programming. I, II (Q1280891) (← links)
- Surrogate gradient algorithm for Lagrangian relaxation (Q1289401) (← links)
- Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem (Q1290717) (← links)
- An improved subgradient method for constrained nondifferentiable optimization (Q1317025) (← links)
- Studying the effects of production loss due to setup in dynamic production scheduling (Q1319562) (← links)
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem (Q1327230) (← links)
- An algorithm for the planar three-index assignment problem (Q1333481) (← links)
- Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem (Q1339135) (← links)
- Multi-item capacitated lot-sizing by a cross decomposition based algorithm (Q1339158) (← links)
- Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem (Q1342649) (← links)
- On some difficult linear programs coming from set partitioning (Q1348247) (← links)
- A heuristic method for lot-sizing in multi-stage systems (Q1370714) (← links)
- Exact algorithm for the surrogate dual of an integer programming problem: Subgradient method approach (Q1389081) (← links)
- Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems (Q1600930) (← links)
- A passenger demand model for airline flight scheduling and fleet routing (Q1603346) (← links)
- Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations (Q1652314) (← links)
- An exact algorithm for the modular hub location problem with single assignments (Q1652348) (← links)
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds (Q1697974) (← links)
