SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Journal of Heuristics

Volumn 19, Issue 4, 2013, Pages 697-709

Variable objective search

(3) Butenko, Sergiy a Yezerska, Oleksandra a Balasundaram, Balabhaskar b

a TEXAS A AND M UNIVERSITY (United States)

b Oklahoma State University (United States)

Author keywords

Binary quadratic programming; Maximum independent set; Variable objective search

Indexed keywords

BINARY QUADRATIC PROGRAMMING; COMBINATORIAL OPTIMIZATION PROBLEMS; MAXIMUM INDEPENDENT SETS; OBJECTIVE FUNCTIONS; VARIABLE OBJECTIVE SEARCH;

MATHEMATICAL PROGRAMMING; SET THEORY;

COMBINATORIAL OPTIMIZATION;

EID: 84880923910 PISSN: 13811231 EISSN: 15729397 Source Type: Journal
DOI: 10.1007/s10732-011-9174-2 Document Type: Article

Times cited : (10)

References (9)

1
- 0003935111
- (eds) Wiley Chichester 1106.90002
- Aarts, E., Lenstra, J.K. (eds.): Local Search in Combinatorial Optimization. Wiley, Chichester (2003)
- (2003) Local Search in Combinatorial Optimization
- Aarts, E.¹ Lenstra, J.K.²

2
- 0035473145
- Finding independent sets in a graph using continuous multivariable polynomial formulations
- 1863329 1068.05049 10.1023/A:1011968411281
- Abello, J., Butenko, S., Pardalos, P., Resende, M.: Finding independent sets in a graph using continuous multivariable polynomial formulations. J. Glob. Optim. 21, 111-137 (2001)
- (2001) J. Glob. Optim. , vol.21 , pp. 111-137
- Abello, J.¹ Butenko, S.² Pardalos, P.³ Resende, M.⁴

3
- 0002590155
- The maximum clique problem
- D.-Z. Du M. Pardalos (eds) Kluwer Academic Dordrecht 10.1007/978-1-4757- 3023-4-1
- Bomze, I.M., Budinich, M., Pardalos, P.M., Pelillo, M.: The maximum clique problem. In: Du, D.-Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, pp. 1-74. Kluwer Academic, Dordrecht (1999)
- (1999) Handbook of Combinatorial Optimization , pp. 1-74
- Bomze, I.M.¹ Budinich, M.² Pardalos, P.M.³ Pelillo, M.⁴

4
- 33745908662
- Accessed April 2010
- DIMACS Cliques, Coloring, and satisfiability: second DIMACS implementation challenge. http://dimacs.rutgers.edu/Challenges/ (1995). Accessed April 2010
- (1995) DIMACS Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge

5
- 0142058675
- Springer London
- Glover, F., Kochenberger, G. (eds.): Handbook Of Metaheuristics. Springer, London (2002)
- (2002) Handbook of Metaheuristics
- Glover, F.¹ Kochenberger, G.²

6
- 0034818087
- Variable neighborhood search: Principles and applications
- 0981.90063 10.1016/S0377-2217(00)00100-4
- Hansen, P., Mladenović, N.: Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130, 449-467 (2001)
- (2001) Eur. J. Oper. Res. , vol.130 , pp. 449-467
- Hansen, P.¹ Mladenović, N.²

7
- 0004216638
- 2 Kluwer Academic Dordrecht 0966.90073
- Horst, R., Pardalos, P.M., Thoai, N.V.: Introduction to Global Optimization, 2 edn. Kluwer Academic, Dordrecht (2000)
- (2000) Introduction to Global Optimization
- Horst, R.¹ Pardalos, P.M.² Thoai, N.V.³

8
- 0031281221
- Variable neighborhood search
- 1471346 0889.90119 10.1016/S0305-0548(97)00031-2
- Mladenović, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24, 1097-1100 (1997)
- (1997) Comput. Oper. Res. , vol.24 , pp. 1097-1100
- Mladenović, N.¹ Hansen, P.²

9
- 0000230999
- Maxima for graphs and a new proof of a theorem of Turán
- 175813 0129.39902 10.4153/CJM-1965-053-6
- Motzkin, T.S., Straus, E.G.: Maxima for graphs and a new proof of a theorem of Turán. Can. J. Math. 17, 533-540 (1965)
- (1965) Can. J. Math. , vol.17 , pp. 533-540
- Motzkin, T.S.¹ Straus, E.G.²

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.