default search action

combined dblp search
author search
venue search
publication search

ask others

Cengiz Haksever

> Home > Persons

Person information

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

Journal Articles

see FAQ

What is the meaning of the colors in the publication lists?

2008
[j4]
- view
  authority control:
- export record
  dblp key:
  - journals/eor/HakseverM08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eor/HakseverM08
Cengiz Haksever, John Moussourakis:
Determining order quantities in multi-product inventory systems subject to multiple constraints and incremental discounts. Eur. J. Oper. Res. 184(3): 930-945 (2008)
1996
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/cor/Haksever96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cor/Haksever96
Cengiz Haksever:
Foreword. Comput. Oper. Res. 23(4) (1996)
1990
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/cor/HakseverR90
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cor/HakseverR90
Cengiz Haksever, Jeffrey L. Ringuest:
Computational efficiency and interactive molp algorithms: An implementation of the simolp procedure. Comput. Oper. Res. 17(1): 39-50 (1990)
1988
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/cor/ArmstrongCH88
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cor/ArmstrongCH88
Ronald D. Armstrong, Abraham Charnes, Cengiz Haksever:
Implementation of successive linear programming algorithms for non-convex goal programming. Comput. Oper. Res. 15(1): 37-49 (1988)

Coauthor Index

see FAQ

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.