The following pages link to (Q3993418):
Displaying 50 items.
- Worst-case analysis of the greedy algorithm for a generalization of the maximum \(p\)-facility location problem (Q1577475) (← links)
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems (Q1580967) (← links)
- Benders-and-cut algorithm for fixed-charge capacitated network design problem (Q1582048) (← links)
- A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles (Q1582189) (← links)
- Heuristic and exact algorithms for the precedence-constrained knapsack problem (Q1586807) (← links)
- The nonlinear knapsack problem - algorithms and applications (Q1600928) (← links)
- Row and column generation technique for a multistage cutting stock problem (Q1603313) (← links)
- An alternative to Ben-Or's lower bound for the knapsack problem complexity (Q1609452) (← links)
- A repeated matching heuristic for the single-source capacitated facility location problem (Q1610126) (← links)
- Nonlinear integer programming for optimal allocation in stratified sampling (Q1610189) (← links)
- Families of non-IRUP instances of the one-dimensional cutting stock problem (Q1613404) (← links)
- Generalized average shadow prices and bottlenecks (Q1616793) (← links)
- Integer optimization with penalized fractional values: the knapsack case (Q1631508) (← links)
- New exact approaches and approximation results for the penalized knapsack problem (Q1634770) (← links)
- Bi-dimensional knapsack problems with one soft constraint (Q1652049) (← links)
- An exact approach for the 0-1 knapsack problem with setups (Q1652189) (← links)
- VCS: A new heuristic function for selecting boxes in the single container loading problem (Q1652261) (← links)
- Lagrangian and branch-and-cut approaches for upgrading spanning tree problems (Q1652284) (← links)
- A low-space algorithm for the subset-sum problem on GPU (Q1652299) (← links)
- A relax-and-cut framework for large-scale maximum weight connected subgraph problems (Q1652399) (← links)
- Exact approaches for the knapsack problem with setups (Q1652523) (← links)
- Customized multi-period stochastic assignment problem for social engagement and opportunistic IoT (Q1652577) (← links)
- Relaxations and heuristics for the multiple non-linear separable knapsack problem (Q1652581) (← links)
- A decision-making tool for energy efficiency optimization of street lighting (Q1652679) (← links)
- A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs (Q1652714) (← links)
- On the product knapsack problem (Q1653266) (← links)
- Exact algorithms for the bin packing problem with fragile objects (Q1662100) (← links)
- A discrete-binary transformation of the reliability redundancy allocation problem (Q1665203) (← links)
- Solving the multiscenario max-MIN knapsack problem exactly with column generation and branch-and-bound (Q1665694) (← links)
- Change-making problems revisited: a parameterized point of view (Q1679517) (← links)
- Criteria of efficiency for set-valued classification (Q1680843) (← links)
- An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem (Q1683061) (← links)
- Convex variational methods on graphs for multiclass segmentation of high-dimensional data and point clouds (Q1702637) (← links)
- Approximating the 3-period incremental knapsack problem (Q1711662) (← links)
- An improved balanced algorithm for the subset-sum problem (Q1713739) (← links)
- Lifting of probabilistic cover inequalities (Q1728321) (← links)
- Minimum tiling of a rectangle by squares (Q1730580) (← links)
- Optimized assignment patterns in mobile edge cloud networks (Q1734851) (← links)
- Lower bounds on the adaptivity gaps in variants of the stochastic knapsack problem (Q1743485) (← links)
- On the best choice of a branching variable in the subset sum problem (Q1744347) (← links)
- Improved Lagrangian bounds and heuristics for the generalized assignment problem (Q1745880) (← links)
- BPPLIB: a library for bin packing and cutting stock problems (Q1746064) (← links)
- Supermodular covering knapsack polytope (Q1751131) (← links)
- The multi-band robust knapsack problem -- a dynamic programming approach (Q1751135) (← links)
- Mixed-integer linear programming heuristics for the prepack optimization problem (Q1751183) (← links)
- The packing while traveling problem (Q1751654) (← links)
- Optimal allocation of buffer times to increase train schedule robustness (Q1752165) (← links)
- FPTAS for the two identical parallel machine problem with a single operator under the free changing mode (Q1752167) (← links)
- A new exact approach for the 0-1 collapsing knapsack problem (Q1753399) (← links)
- Multi-objective branch and bound (Q1753506) (← links)
