Editorial
- 作者Helen Nissenbaum
- 卷第2卷
- 期第4期
- 印刷ISSN1388-1957
- 电子ISSN1572-8439
- 文件大小15.45KB
- 发表时间2000-12
- DOI10.1023/a:1011454113301
- 页码199-200
The capacitated maxk-cut problemDaya Ram Gaur; Ramesh Krishnamurti; Rajeev Kohli · 2008
Erratum to: The capacitated maxk-cut problemDaya Ram Gaur; Ramesh Krishnamurti; Rajeev Kohli · 2011
Conflict Resolution in the Scheduling of Television CommercialsDaya Ram Gaur, Ramesh Krishnamurti and Rajeev Kohli · Operations Research · 2009
Conflict Resolution in the Scheduling of Television CommercialsGaur, Daya Ram; Krishnamurti, Ramesh; Kohli, Rajeev · Operations Research · 2009
Berge’s theorem for the maximum charge problemRamesh Krishnamurti; Daya Ram Gaur; Subir Kumar Ghosh; Horst Sachs · 2006
An approximation algorithm for nonpreemptive scheduling on hypercube parallel task systemsRamesh Krishnamurti; Daya Ram Gaur · 1999
Self-duality of bounded monotone boolean functions and related problemsDaya Ram Gaur; Ramesh Krishnamurti · 2008
Perfect Circular Arc ColoringXujin Chen; Zhiquan Hu; Wenan Zang · Journal of Combinatorial Optimization · 2005
The Polymatroid Steiner ProblemsG. Calinescu; A. Zelikovsky · Journal of Combinatorial Optimization · 2005
EditorialPanos M. Pardalos · Journal of Combinatorial Optimization · 2005
On Split-Coloring ProblemsT. Ekim; D. de Werra · Journal of Combinatorial Optimization · 2005
Testing Systems of Identical ComponentsTonguç Ünlüyurt · Journal of Combinatorial Optimization · 2005
EditorialMaggie X. Cheng · Journal of Combinatorial Optimization · 2006
ErratumT. Ekim; D. de Werra · Journal of Combinatorial Optimization · 2006
Introduction to the special issueLusheng Wang · Journal of Combinatorial Optimization · 2006