On triangle-free graphs of order 10 with prescribed 1-defective chromatic number

Autor: Achuthan, Nirmala, Achuthan, N. R., Keady, G.

A graph is (m, k)-colourable if its vertices can be coloured with m colours such that the maximum degree of any subgraph induced on ver- tices receiving the same colour is at most k. The k-defective chromatic number for a graph is the least positive

Externí odkaz: http://arxiv.org/abs/1501.04384

Project Scheduling under Time Dependent Costs -- A Branch and Bound Algorithm.

Autor: Achuthan, N. R.¹, Hardjawidjaja, A.¹

Publikováno v: Annals of Operations Research. 2001, Vol. 108 Issue 1-4, p55-74. 20p. 5 Charts, 2 Graphs.

Estimating Sufficient Sample Sizes for Approximate Decision Support Queries.

Autor: Rudra, Amit, Gopalan, Raj P., Achuthan, N. R.

Publikováno v: Enterprise Information Systems: 15th International Conference, ICEIS 2013, Angers, France, July 4-7, 2013, Revised Selected Papers; 2014, p85-99, 15p

DECISION SUPPORT TOOL FOR RETAIL SHELF SPACE OPTIMIZATION.

Autor: RAMASESHAN, B.¹ ramaseshanb@cbs.curtin.edu.au, ACHUTHAN, N. R.² archi@maths.curtin.edu.au, COLLINSON, R.² R.Collinson@curtin.edu.au

Publikováno v: International Journal of Information Technology & Decision Making. Sep2008, Vol. 7 Issue 3, p547-565. 19p. 8 Color Photographs, 2 Diagrams, 1 Chart, 2 Graphs.

Integer linear programming formulation for a vehicle routing problem.

Autor: Achuthan, N. R.¹, Caccetta, L.¹

Publikováno v: European Journal of Operational Research. 5/6/91, Vol. 52 Issue 1, p86-89. 4p. 1 Diagram.