Backdoors to combinatorial optimization: Feasibility and optimality

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5547 LNCS, Issue , 2009, Pages 56-70

  Dilkina, Bistra ^a   Gomes, Carla P ^a   Malitsky, Yuri ^b   Sabharwal, Ashish ^a   Sellmann, Meinolf ^b  

^a School of Operations Research and Information Engineering   (United States)

^b Brown Univerity   (United States)

Author keywords

Backdoor sets; Search; Variable selection

Indexed keywords

BACKDOOR SETS; BACKDOORS; COMBINATORIAL PROBLEM; CONTINUOUS VARIABLES; DECISION PROBLEMS; DISCRETE VARIABLES; EFFICIENT ALGORITHM; FEASIBLE SOLUTION; MIXED INTEGER PROGRAMMING; OPTIMAL SOLUTIONS; OPTIMALITY; OPTIMIZATION PROBLEMS; PROBLEM STRUCTURE; SEARCH; VARIABLE SELECTION;

ALGORITHMS; COMBINATORIAL OPTIMIZATION; COMPUTER PROGRAMMING; COMPUTER SOFTWARE SELECTION AND EVALUATION; CONSTRAINED OPTIMIZATION; CONSTRAINT THEORY; INTEGER PROGRAMMING; PACKET NETWORKS; SHAPE OPTIMIZATION; STRUCTURAL OPTIMIZATION;

SET THEORY;

EID: 69849086850     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-01929-6_6     Document Type: Conference Paper

References (12)

1. Achterberg, T., Koch, T., Martin, A.: MIPLIB 2003. Operations Research Letters 34(4), 1-12 (2006), http://miplib.zib.de
2. Bixby, R.E.: Solving real-world linear programs: A decade and more of progress. Oper. Res. 50(1), 3-15 (2002)
3. Dilkina, B., Gomes, C.P., Sabharwal, A.: Tradeoffs in the complexity of backdoor detection. In: Bessiere, C. (ed.) CP 2007. LNCS, vol.4741, pp. 256-270. Springer, Heidelberg (2007)
4. Gent, I.P., Walsh, T.: Easy problems are sometimes hard. AI J. 70, 335-345 (1994)
5. Gomes, C.P., Selman, B., Crato, N.: Heavy-tailed distributions in combinatorial search. In: Smolka, G. (ed.) CP 1997. LNCS, vol.1330, pp. 121-135. Springer, Heidelberg (1997)
6. Gomes, C.P., Selman, B., McAloon, K., Tretkoff, C.: Randomization in backtrack search: Exploiting heavy-tailed profiles for solving hard scheduling problems. In: 4th Int. Conf. Art. Intel. Planning Syst. (1998)
7. Hogg, T., Williams, C.: Expected gains from parallelizing constraint solving for hard problems. In: Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI 1994), Seattle, WA, pp. 1310-1315. AAAI Press, Menlo Park (1994)
8. ILOG, SA. CPLEX 10.1 Reference Manual (2006)
9. Li, C.M., Anbulagan: Heuristics based on unit propagation for satisfiability problems. In: 15th IJCAI, Nagoya, Japan, pp. 366-371 (August 1997)
10. Smith, B.M., Grant, S.A.: Sparse constraint graphs and exceptionally hard problems. In: 14th IJCAI, Montreal, Canada, vol.1, pp. 646-654 (August 1995)
11. Williams, R., Gomes, C., Selman, B.: Backdoors to typical case complexity. In: 18th IJCAI, Acapulco, Mexico, pp. 1173-1178 (August 2003)
12. Williams, R., Gomes, C., Selman, B.: On the connections between heavy-tails, backdoors, and restarts in combinatorial search. In: 6th SAT, Santa Margherita Ligure, Italy, pp. 222-230 (May 2003)