The following pages link to (Q3993418):
Displayed 50 items.
- The cardinality and precedence constrained maximum value sub-hypergraph problem and its applications (Q678869) (← links)
- Constraint logic programming and integer programming approaches and their collaboration in solving an assignment scheduling problem (Q679422) (← links)
- Geometric Knapsack problems (Q689105) (← 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)
- 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)
- 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)
- 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)
- 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)
- 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)
- The 0-1 knapsack problem with fuzzy data (Q1001155) (← links)