The following pages link to (Q3993418):
Displaying 50 items.
- The constrained compartmentalised knapsack problem (Q868151) (← links)
- New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation (Q868985) (← links)
- An LP-based heuristic procedure for the generalized assignment problem with special ordered sets (Q868998) (← links)
- Model and algorithms for multi-period sea cargo mix problem (Q872163) (← links)
- Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem (Q875412) (← links)
- Bound sets for biobjective combinatorial optimization problems (Q875413) (← links)
- The quadratic knapsack problem -- a survey (Q875597) (← links)
- Preference programming for robust portfolio modeling and project selection (Q877643) (← links)
- New bin packing fast lower bounds (Q883309) (← links)
- Sparse grid quadrature on products of spheres (Q891778) (← links)
- Confidence-based reasoning in stochastic constraint programming (Q896433) (← links)
- Competitive algorithms for unbounded one-way trading (Q897958) (← links)
- An ant colony optimization approach for binary knapsack problem under fuzziness (Q907543) (← links)
- An exact algorithm for large unbounded knapsack problems (Q913659) (← links)
- Exact algorithms for the joint object placement and request routing problem in content distribution networks (Q925830) (← links)
- Exact and heuristic solution approaches for the mixed integer setup knapsack problem (Q928018) (← links)
- A GA based heuristic for the vehicle routing problem with multiple trips (Q928681) (← links)
- Qos-aware service evaluation and selection (Q932236) (← links)
- Single-vendor multi-buyer inventory coordination under private information (Q933523) (← links)
- On control of the false discovery rate under no assumption of dependency (Q935450) (← links)
- Some observations about the extreme points of the generalized cardinality-constrained shortest path problem polytope (Q941053) (← links)
- A new polynomial time algorithm for 0-1 multiple knapsack problem based on dominant principles (Q941476) (← links)
- Nonconvex piecewise linear knapsack problems (Q948649) (← links)
- \(L\)-class enumeration algorithms for a discrete production planning problem with interval resource quantities (Q954026) (← links)
- A robust approach to the chance-constrained knapsack problem (Q957372) (← links)
- Solving knapsack problems with \(S\)-curve return functions (Q958108) (← links)
- A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations (Q958450) (← links)
- A dynamic programming based heuristic for the assembly line balancing problem (Q958561) (← links)
- Repulsive assignment problem (Q963661) (← links)
- Analysis of maximum total return in the continuous knapsack problem with fuzzy object weights (Q965587) (← links)
- A note on the minimum bounded edge-partition of a tree (Q967344) (← links)
- Mathematical models for optimal usage of tributary cards in wavelength assignment for DWDM ring networks (Q969908) (← links)
- Routing traffic at hub facilities (Q972437) (← links)
- Theoretical investigations on maximal dual feasible functions (Q974987) (← links)
- Asymptotic fully polynomial approximation schemes for variants of open-end bin packing (Q975519) (← links)
- A Lagrangian bound for many-to-many assignment problems (Q975754) (← links)
- Black box scatter search for general classes of binary optimization problems (Q976017) (← links)
- Pre-disaster investment decisions for strengthening a highway network (Q976032) (← links)
- Performance analysis of branch-and-bound skeletons (Q984170) (← links)
- Efficient heuristic algorithms for path-based hardware/software partitioning (Q988463) (← links)
- The small world of efficient solutions: empirical evidence from the bi-objective \(\{0,1\}\)-knapsack problem (Q989830) (← links)
- A multiobjective metaheuristic for a mean-risk static stochastic knapsack problem (Q989843) (← links)
- Exact algorithm for bi-objective 0-1 knapsack problem (Q990717) (← links)
- Brams-Taylor model of fair division for divisible and indivisible items (Q991311) (← links)
- The bilevel knapsack problem with stochastic right-hand sides (Q991476) (← links)
- Using modifications to Grover's search algorithm for quantum global optimization (Q992656) (← links)
- What foreclosed homes should a municipality purchase to stabilize vulnerable neighborhoods? (Q993470) (← links)
- Competitive analysis of online real-time scheduling algorithms under hard energy constraint (Q993512) (← links)
- Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem (Q995928) (← links)
- Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths (Q1001001) (← links)
