The following pages link to (Q3993418):
Displaying 50 items.
- The 0-1 knapsack problem with fuzzy data (Q1001155) (← links)
- An algorithm for the generalized quadratic assignment problem (Q1001198) (← links)
- Convergent Lagrangian and domain cut method for nonlinear knapsack problems (Q1001200) (← links)
- On the convergence of the Weiszfeld algorithm for continuous single facility location-allocation problems (Q1001365) (← links)
- Algorithmic aspects for power-efficient hardware/software partitioning (Q1010046) (← links)
- Bounding approaches for operation assignment and capacity allocation problem in flexible manufacturing systems (Q1010255) (← links)
- An exact algorithm for the fixed-charge multiple knapsack problem (Q1011207) (← links)
- A hybrid algorithm for the unbounded knapsack problem (Q1013302) (← links)
- A trust branching path heuristic for zero-one programming (Q1014935) (← links)
- Bidimensional packing by bilinear programming (Q1016113) (← links)
- Two heuristics for the one-dimensional bin-packing problem (Q1018262) (← links)
- GreedEx---a scalable clearing mechanism for utility computing (Q1020573) (← links)
- A matching algorithm for the distribution of human pancreatic islets (Q1020642) (← links)
- The transportation problem with exclusionary side constraints (Q1022437) (← links)
- Approximation algorithms for single machine scheduling with one unavailability period (Q1022445) (← links)
- New lower bounds based on column generation and constraint programming for the pattern minimization problem (Q1025240) (← links)
- An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem (Q1025258) (← links)
- Solving a tactical operating room planning problem by a column-generation-based heuristic procedure with four criteria (Q1026554) (← links)
- A computational evaluation of a general branch-and-price framework for capacitated network location problems (Q1026595) (← links)
- Exact algorithms for the two-dimensional strip packing problem with and without rotations (Q1027586) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- A branch-and-price algorithm for the two-dimensional level strip packing problem (Q1029564) (← links)
- Priority algorithms for the subset-sum problem (Q1029701) (← links)
- Approximation algorithms for orthogonal packing problems for hypercubes (Q1035685) (← links)
- An agent-based stochastic ruler approach for a stochastic knapsack problem with sequential competition (Q1038300) (← links)
- Extending the alternating-offers protocol in the presence of competition: Models and theoretical analysis (Q1039591) (← links)
- A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem (Q1039776) (← links)
- The submodular knapsack polytope (Q1040079) (← links)
- Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem (Q1040083) (← links)
- Knapsack problems with setups (Q1041933) (← links)
- Cut generation for an employee timetabling problem (Q1042034) (← links)
- Balancing assembly lines with variable parallel workplaces: problem definition and effective solution procedure (Q1042153) (← links)
- Heuristics for the 0-1 multidimensional knapsack problem (Q1042198) (← links)
- Lagrangean duals and exact solution to the capacitated \(p\)-center problem (Q1044136) (← links)
- Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core (Q1044419) (← links)
- Market-based pricing in grids: on strategic manipulation and computational cost (Q1046122) (← links)
- An exact algorithm for large multiple knapsack problems (Q1124710) (← links)
- A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls (Q1124810) (← links)
- An exact algorithm for the capacitated facility location problems with single sourcing (Q1124811) (← links)
- CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem (Q1127211) (← links)
- Specialized inspection problems in serial production systems (Q1129930) (← links)
- Bounds for nested knapsack problems (Q1130040) (← links)
- Packing problems (Q1197916) (← links)
- The vehicle routing problem: An overview of exact and approximate algorithms (Q1198313) (← links)
- A note on 0.5-bounded greedy algorithms for the 0/1 knapsack problem (Q1208445) (← links)
- The capacitated distribution and waste disposal problem (Q1266619) (← links)
- A heuristic algorithm for the asymmetric capacitated vehicle routing problem (Q1266654) (← links)
- Auxiliary tool allocation in flexible manufacturing systems (Q1266742) (← links)
- Properties of some ILP formulations of a class of partitioning problems (Q1270767) (← links)
- A relation between the knapsack and group knapsack problems (Q1270786) (← links)
