The following pages link to (Q3993418):
Displaying 50 items.
- Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem (Q5085469) (← links)
- (Q5089171) (← links)
- A bilevel “Attacker–Defender” model to choosing the composition of attack means (Q5090136) (← links)
- A minimal algorithm for the Bounded Knapsack Problem (Q5101408) (← links)
- A framework for tightening 0–1 programs based on extensions of pure 0–1 KP and SS problems (Q5101409) (← links)
- Logarithmic Regret in the Dynamic and Stochastic Knapsack Problem with Equal Rewards (Q5119417) (← links)
- On Bilevel Optimization with Inexact Follower (Q5120277) (← links)
- Approximations to Stochastic Dynamic Programs via Information Relaxation Duality (Q5126622) (← links)
- Fast Approximation Methods for Online Scheduling of Outpatient Procedure Centers (Q5131692) (← links)
- Interdiction Games and Monotonicity, with Application to Knapsack Problems (Q5138270) (← links)
- Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets (Q5139632) (← links)
- Dynamic Programming for an Optimal and Equitable Public Load Shedding Schedule (Q5145058) (← links)
- A Decentralized Heuristic for Multiple-Choice Combinatorial Optimization Problems (Q5171816) (← links)
- Analysis of Solution Quality of a Multiobjective Optimization-Based Evolutionary Algorithm for Knapsack Problem (Q5194626) (← links)
- Strong geodetic problem on complete multipartite graphs (Q5217086) (← links)
- When Human Visual Performance Is Imperfect—How to Optimize the Collaboration Between One Human Operator and Multiple Field Robots (Q5223148) (← links)
- Bicriteria Data Compression (Q5242925) (← links)
- Metaheuristics for the vehicle routing problem with loading constraints (Q5295486) (← links)
- FAST NON-NEGATIVE LEAST-SQUARES LEARNING IN THE RANDOM NEURAL NETWORK (Q5358086) (← links)
- Integrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack Solver (Q5387622) (← links)
- Bin packing with directed stackability conflicts (Q5501519) (← links)
- Optimal Individualized Decision Rules Using Instrumental Variable Methods (Q5857139) (← links)
- Improved Online Algorithms for Knapsack and GAP in the Random Order Model (Q5875474) (← links)
- A knapsack problem for rectangles under the gravity center constraints (Q5878628) (← links)
- Design of a quality control network for an international food company (Q5882373) (← links)
- Constraint programming-based column generation (Q5902286) (← links)
- Random knapsack in expected polynomial time (Q5917572) (← links)
- Constraint programming-based column generation (Q5919991) (← links)
- Basket problems in margin calculation: modelling and algorithms. (Q5925945) (← links)
- Budgeting with bounded multiple-choice constraints. (Q5928374) (← links)
- Optimal resource allocation with minimum activation levels and fixed costs (Q5935386) (← links)
- The stochastic generalised assignment problem with Bernoulli demands (Q5937138) (← links)
- A tabu search heuristic for the generalized assignment problem (Q5938390) (← links)
- Lower bounds and algorithms for the 2-dimensional vector packing problem (Q5939229) (← links)
- Bounds for the cardinality constrained \(P \|C_{max}\) problem (Q5939270) (← links)
- A polynomially solvable special case of the unbounded knapsack problem (Q5949903) (← links)
- A time-dependent multiple criteria single-machine scheduling problem (Q5954823) (← links)
- Using fuzzy numbers in knapsack problems (Q5954834) (← links)
- An exact algorithm for the subset sum problem (Q5955091) (← links)
- The peak load minimization problem in cyclic production (Q5955976) (← links)
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems (Q5959380) (← links)
- A pegging algorithm for the nonlinear resource allocation problem (Q5959400) (← links)
- Algorithms for minclique scheduling problems (Q5961609) (← links)
- Approximation algorithms for scheduling with reservations (Q5961975) (← links)
- Lagrangian heuristics for the quadratic knapsack problem (Q5963311) (← links)
- Lagrangian matheuristics for the quadratic multiple knapsack problem (Q6041829) (← links)
- A lifted-space dynamic programming algorithm for the quadratic knapsack problem (Q6041830) (← links)
- A three-phase matheuristic algorithm for the multi-day task assignment problem (Q6047850) (← links)
- A novel reformulation for the single-sink fixed-charge transportation problem (Q6052058) (← links)
- Integer knapsack problems with profit functions of the same value range (Q6054010) (← links)
