메뉴 건너뛰기




Volumn 95, Issue 2, 1996, Pages 420-426

QUAD01: A data-structured implementation of Hansen's quadratic zero-one programming algorithm

Author keywords

Boolean programming; Computers; Optimisation; Quadratic programming

Indexed keywords

BOOLEAN FUNCTIONS; C (PROGRAMMING LANGUAGE); COMPUTERS; CONSTRAINT THEORY; DATA STRUCTURES; MATHEMATICAL PROGRAMMING; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS;

EID: 0030572948     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(95)00298-7     Document Type: Article
Times cited : (1)

References (9)
  • 2
    • 0028807355 scopus 로고
    • The location of ambivalent facilities: Use of a quadratic zero-one programming algorithm
    • Comley, W.J., 1995. The location of ambivalent facilities: Use of a quadratic zero-one programming algorithm. Applied Mathematical Modelling 19, 26-29.
    • (1995) Applied Mathematical Modelling , vol.19 , pp. 26-29
    • Comley, W.J.1
  • 3
    • 0020815626 scopus 로고
    • Solving large-scale zero-one linear programming problems
    • Crowder, H., Johnson, E.L. and Padberg, M., 1983. Solving large-scale zero-one linear programming problems. Operations Research 31, 803-834.
    • (1983) Operations Research , vol.31 , pp. 803-834
    • Crowder, H.1    Johnson, E.L.2    Padberg, M.3
  • 5
    • 0001189913 scopus 로고
    • Note on converting the 0-1 polynomial programming problem to a 0-1 linear program
    • Glover, F. and Woolsey, R.E.D, 1974. Note on converting the 0-1 polynomial programming problem to a 0-1 linear program. Operations Research 22, 180-181.
    • (1974) Operations Research , vol.22 , pp. 180-181
    • Glover, F.1    Woolsey, R.E.D.2
  • 6
    • 0039167369 scopus 로고
    • Quadratic zero-one programming by implicit enumeration
    • F.A. Lootsma (ed.), Academic Press, London
    • Hansen, P., 1972. Quadratic zero-one programming by implicit enumeration. In: F.A. Lootsma (ed.), Numerical Methods for Non-linear Optimization, Academic Press, London, 265-278.
    • (1972) Numerical Methods for Non-linear Optimization , pp. 265-278
    • Hansen, P.1
  • 7
    • 77957783608 scopus 로고
    • Methods of non-linear 0-1 programming
    • P.L. Hammer, E.L. Johnson and B.H. Korte (eds.), North-Holland, Amsterdam
    • Hansen, P., 1979. Methods of non-linear 0-1 programming. In: P.L. Hammer, E.L. Johnson and B.H. Korte (eds.), Discrete Optimization II, North-Holland, Amsterdam, 53-70.
    • (1979) Discrete Optimization Ii , pp. 53-70
    • Hansen, P.1
  • 8
    • 38249013747 scopus 로고
    • Complexity of uniqueness and local search in quadratic 0-1 programming
    • Pardalos, P.M. and Jha, S., 1992. Complexity of uniqueness and local search in quadratic 0-1 programming. Operations Research Letters 11, 119-123.
    • (1992) Operations Research Letters , vol.11 , pp. 119-123
    • Pardalos, P.M.1    Jha, S.2
  • 9
    • 0000176856 scopus 로고
    • Parallel branch and bound algorithms for quadratic zero-one on a hypercube architecture
    • Pardalos, P.M. and Rodgers, G.P., 1990. Parallel branch and bound algorithms for quadratic zero-one on a hypercube architecture. Annals of Operations Research 22, 271-292.
    • (1990) Annals of Operations Research , vol.22 , pp. 271-292
    • Pardalos, P.M.1    Rodgers, G.P.2


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