Cooperative strategies for solving the bicriteria sparse multiple knapsack problem

Journal of Heuristics

Volumn 8, Issue 2, 2002, Pages 215-239

  Salman, F Sibel ^a   Kalagnanam, Jayant R ^b   Murthy, Sesh ^b   Davenport, Andrew ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Asynchronous teams; Bicriteria; Cooperation; Multiple heuristics; Multiple knapsack

Indexed keywords

ALGORITHMS; C (PROGRAMMING LANGUAGE); COMPUTATIONAL COMPLEXITY; GRAPH THEORY; INTEGER PROGRAMMING; INVENTORY CONTROL; LINEAR PROGRAMMING; PROBLEM SOLVING; PRODUCTION ENGINEERING; UNIX;

ASYNCHRONOUS TEAMS; BICRITERIA SPARSE MULTIPLE KNAPSACK PROBLEM; COOPERATIVE STRATEGIES; HEURISTIC ALGORITHMS; MULTIPLE HEURISTICS; TABU SEARCH METHOD;

HEURISTIC METHODS;

EID: 0036496786     PISSN: 13811231     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1017964608086     Document Type: Article

References (32)

1. The reactive tabu search
2. Approximation algorithms for binpacking: An updated survey
3. Approximation algorithms for binpacking: A survey
4. Using the CPLEX linear optimizer
5. Approximation algorithms for the multiple knapsack problem with assignment restrictions
6. The hearsay-II speech-understanding system: Integrating knowledge to resolve uncertainty
7. Solving multiple knapsack problems by cutting planes
8. Variable sized bin packing
9. Tabu search part I
10. Tabu search part II
11. Algorithm portfolio design: Theory vs. practice
12. An economics approach to hard computational problems
13. An algorithm for 0-1 multiple knapsack problems
14. The surplus inventory matching problem in the process industry
15. Reducibility among combinatorial problems
16. Scheduling solutions for the paper industry
17. Primary production scheduling at steel-making industries
18. Solution of the zero-one multiple knapsack problem
19. A bound and bound algorithm for the zero-one multiple knapsack problem
20. Heuristic algorithms for the multiple knapsack problem
21. Lower bounds and reduction procedures for the bin packing problem
22. Synergy in cooperating agents: Designing manipulators from task specifications
23. Agent-based cooperative scheduling
24. A new approach to integrating mixed integer programming with constraint logic programming
25. An integrated framework for generating and revising factory schedules
26. Asynchronous organizations for multi-algorithm problems
27. Organizations for computer-based agents