default search action

combined dblp search
author search
venue search
publication search

ask others

Kavindra Malik

> Home > Persons

Person information

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

1990 – 1999

see FAQ

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

1998
[j4]
- view
  authority control:
- export record
  dblp key:
  - journals/anor/IakovouKM98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/anor/IakovouKM98
Eleftherios Iakovou, Christos Koulamas, Kavindra Malik:
Part selection and tool allocation in discrete parts manufacturing. Ann. Oper. Res. 76: 187-200 (1998)
1996
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/acta/KumarM96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/acta/KumarM96
Akhil Kumar, Kavindra Malik:
Optimizing the Costs of Hierarchical Quorum Consensus. Acta Informatica 33(3): 255-275 (1996)
1994
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/anor/EscuderoGM94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/anor/EscuderoGM94
Laureano F. Escudero, Monique Guignard, Kavindra Malik:
A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships. Ann. Oper. Res. 50(1): 219-237 (1994)
1993
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/networks/MalikY93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/MalikY93
Kavindra Malik, Gang Yu:
A branch and bound algorithm for the capacitated minimum spanning tree problem. Networks 23(6): 525-532 (1993)

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.