The following pages link to (Q4178782):
Displayed 50 items.
- A Benders decomposition based heuristic for the hierarchical production planning problem (Q584066) (← links)
- Solving network manpower problems with side constraints (Q595507) (← 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 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)
- Spectral projected subgradient with a momentum term for the Lagrangean dual approach (Q878598) (← links)
- A solution procedure for general knapsack problems with a few constraints (Q908852) (← links)
- A Lagrangean dual ascent algorithm for simple plant location problems (Q911446) (← links)
- Multi-level production scheduling for a class of flexible machining and assembly systems (Q918393) (← links)
- A surrogate and Lagrangian approach to constrained network problems (Q920831) (← links)
- Analysis of relaxations for the multi-item capacitated lot-sizing problem (Q922259) (← links)
- Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design (Q925847) (← links)
- Facility location for market capture when users rank facilities by shorter travel and waiting times (Q930936) (← 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)
- The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times (Q955327) (← links)
- Multi-phase dynamic constraint aggregation for set partitioning type problems (Q964175) (← links)
- Convergent Lagrangian and domain cut method for nonlinear knapsack problems (Q1001200) (← links)
- A column generation heuristic for a dynamic generalized assignment problem (Q1010279) (← links)
- On minimum \(k\)-modal partitions of permutations (Q1018088) (← links)
- Multi-commodity supply network planning in the forest supply chain (Q1027559) (← links)
- Cut generation for an employee timetabling problem (Q1042034) (← links)
- Resource-constrained management of heterogeneous assets with stochastic deterioration (Q1042122) (← links)
- Clique inference process for solving Max-CSP (Q1042201) (← links)
- The zero-one knapsack problem with equality constraint (Q1058453) (← links)
- A comparison of two dual-based procedures for solving the p-median problem (Q1058960) (← links)
- A tree search algorithm for the multi-commodity location problem (Q1058962) (← links)
- Principal direction search: A new method of search for unconstrained LP formulations (Q1058964) (← links)
- Zero-one integer programs with few contraints - lower bounding theory (Q1060954) (← links)
- Capital budgeting with Benders' decomposition (Q1062887) (← links)
- A partial dual algorithm for the capacitated warehouse location problem (Q1067966) (← links)
- 'Multidimensional' extensions and a nested dual approach for the m-median problem (Q1072925) (← links)