The following pages link to (Q3993418):
Displayed 50 items.
- Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product (Q257209) (← links)
- The generalized assignment problem with minimum quantities (Q257215) (← links)
- Online knapsack revisited (Q260271) (← links)
- Continuous knapsack sets with divisible capacities (Q263180) (← links)
- Implicit cover inequalities (Q266036) (← links)
- Optimizing some constructions with bars: new geometric knapsack problems (Q266044) (← links)
- The online knapsack problem with incremental capacity (Q283993) (← links)
- A polynomial-time algorithm for knapsack with divisible item sizes (Q287072) (← links)
- Robust optimization approach for a chance-constrained binary knapsack problem (Q291067) (← links)
- An approximate binary search algorithm for the multiple-choice knapsack problem (Q293371) (← links)
- Baseline value specification and sensitivity analysis in multiattribute project portfolio selection (Q296608) (← links)
- A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services (Q297101) (← links)
- Convergence of quasi-optimal sparse-grid approximation of Hilbert-space-valued functions: Application to random elliptic PDEs (Q315715) (← links)
- An exact algorithm for the reliability redundancy allocation problem (Q319293) (← links)
- Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems (Q319373) (← links)
- Defining line replaceable units (Q319976) (← links)
- The multiple container loading problem with preference (Q320625) (← links)
- Robust optimization of the 0-1 knapsack problem: balancing risk and return in assortment optimization (Q322574) (← links)
- An exact decomposition algorithm for the generalized knapsack sharing problem (Q322972) (← links)
- Adjustable robustness for multi-attribute project portfolio selection (Q323007) (← links)
- An approximate dynamic programming approach for improving accuracy of lossy data compression by Bloom filters (Q323016) (← links)
- Logistics capacity planning: a stochastic bin packing formulation and a progressive hedging meta-heuristic (Q323187) (← links)
- Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
- An implementation of exact knapsack separation (Q330511) (← links)
- Models for the two-dimensional two-stage cutting stock problem with multiple stock size (Q336416) (← links)
- Generalized quadratic multiple knapsack problem and two solution approaches (Q336889) (← links)
- A beam search approach to the container loading problem (Q336892) (← links)
- A Lagrangian heuristic for sprint planning in agile software development (Q336900) (← links)
- Mathematical programming algorithms for bin packing problems with item fragmentation (Q336982) (← links)
- Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools (Q337131) (← links)
- Optimal interval scheduling with a resource constraint (Q337149) (← links)
- Rapid calculation of exact cell bounds for contingency tables from conditional frequencies (Q337192) (← links)
- A two level metaheuristic for the operating room scheduling and assignment problem (Q337329) (← links)
- A grouping genetic algorithm with controlled gene transmission for the bin packing problem (Q337402) (← links)
- Solution approaches for the cutting stock problem with setup cost (Q339571) (← links)
- Solution method for the location planning problem of logistics park with variable capacity (Q339598) (← links)
- Integrated model for software component selection with simultaneous consideration of implementation and verification (Q339707) (← links)
- An AFPTAS for variable sized bin packing with general activation costs (Q340560) (← links)
- Determining the \(K\)-best solutions of knapsack problems (Q342015) (← links)
- A dynamic programming algorithm for the knapsack problem with setup (Q342065) (← links)
- Finding compromise solutions in project portfolio selection with multiple experts by inverse optimization (Q342154) (← links)
- Unsplittable non-additive capacitated network design using set functions polyhedra (Q342169) (← links)
- Solving a dynamic facility location problem with partial closing and reopening (Q342268) (← links)
- Optimized load planning for motorail transportation (Q342294) (← links)
- A heuristic for maximizing investigation effectiveness of digital forensic cases involving multiple investigators (Q342305) (← links)
- A binary multiple knapsack model for single machine scheduling with machine unavailability (Q342369) (← links)
- Exactly solving packing problems with fragmentation (Q342536) (← links)
- Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing (Q342540) (← links)
- Continuous location of an assembly station (Q356516) (← links)
- Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem (Q360382) (← links)