The following pages link to (Q3993418):
Displaying 50 items.
- Constraint logic programming and integer programming approaches and their collaboration in solving an assignment scheduling problem (Q679422) (← links)
- Geometric Knapsack problems (Q689105) (← links)
- Recoverable robust knapsacks: the discrete scenario case (Q691430) (← links)
- Simple solution methods for separable mixed linear and quadratic knapsack problem (Q693416) (← links)
- Recent advances on two-dimensional bin packing problems (Q697576) (← links)
- Models, relaxations and exact approaches for the capacitated vehicle routing problem (Q697581) (← links)
- Facility location models for distribution system design (Q707128) (← links)
- Heuristic algorithms for the general nonlinear separable knapsack problem (Q709196) (← links)
- The static stochastic knapsack problem with normally distributed item sizes (Q715062) (← links)
- The open capacitated arc routing problem (Q716347) (← links)
- A multi-criteria approach to approximate solution of multiple-choice knapsack problem (Q721960) (← links)
- Decomposition approaches to integration without a measure (Q723231) (← links)
- Classification and literature review of integrated lot-sizing and cutting stock problems (Q724044) (← links)
- Algorithms for the one-dimensional two-stage cutting stock problem (Q724047) (← links)
- The newsvendor problem with capacitated suppliers and quantity discounts (Q724067) (← links)
- The subset assignment problem for data placement in caches (Q724230) (← links)
- On optimality of the Benjamini-Hochberg procedure for the false discovery rate (Q730705) (← links)
- One approach to solving a discrete production planning problem with interval data (Q735645) (← links)
- Integer programming based heterogeneous CPU-GPU cluster schedulers for SLURM resource manager (Q743104) (← links)
- The zone hopping problem (Q750298) (← links)
- Chebyshev center based column generation (Q765323) (← links)
- Efficiently solving the traveling thief problem using hill climbing and simulated annealing (Q781909) (← links)
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem (Q817190) (← links)
- A conditional logic approach for strengthening mixed 0-1 linear programs (Q817194) (← links)
- An exact algorithm for the knapsack sharing problem with common items (Q817562) (← links)
- An optimization algorithm for the clearing of interbank payments (Q819066) (← links)
- An analysis of the integrated lot-sizing and cutting-stock problem formulation (Q821771) (← links)
- Knapsack polytopes: a survey (Q827125) (← links)
- Effective parallelization strategy for the solution of subset sum problems by the branch-and-bound method (Q828198) (← links)
- On exact solution approaches for bilevel quadratic 0-1 knapsack problem (Q829202) (← links)
- Algorithmic analysis of priority-based bin packing (Q831745) (← links)
- Integer programming models for deployment of airport baggage screening security devices (Q833390) (← links)
- A dynamic programming algorithm for the bilevel Knapsack problem (Q833584) (← links)
- Single-machine scheduling with trade-off between number of tardy jobs and compression cost (Q835563) (← links)
- Exact solution method to solve large scale integer quadratic multidimensional knapsack problems (Q841599) (← links)
- The linking set problem: a polynomial special case of the multiple-choice knapsack problem (Q844527) (← links)
- On solving the Lagrangian dual of integer programs via an incremental approach (Q849073) (← links)
- Using separable programming to solve the multi-product multiple ex-ante constraint newsvendor problem and extensions (Q852959) (← links)
- Polyhedral analysis for concentrator location problems (Q853560) (← links)
- Vote trading in public elections (Q855754) (← links)
- A biobjective method for sample allocation in stratified sampling (Q856297) (← links)
- An exact algorithm for generating homogeneous T-shape cutting patterns (Q856687) (← links)
- An exact parallel method for a bi-objective permutation flowshop problem (Q857297) (← links)
- Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems (Q857299) (← links)
- Exact admission-control for integrated aperiodic and periodic tasks (Q858323) (← links)
- Multiattribute electronic procurement using goal programming (Q858469) (← links)
- A new lower bound for the linear knapsack problem with general integer variables (Q859686) (← links)
- Order splitting with multiple capacitated suppliers (Q859919) (← links)
- LP based heuristics for the multiple knapsack problem with assignment restrictions (Q863573) (← links)
