Result 1 to 20 of 38 total
The Nordhaus-Gaddum problem for the $k$-defective chromatic number of a $P_4$-free graph. (English)
Australas. J. Comb. 49, 3-13 (2011).
1
On minimal triangle-free graphs with prescribed $k$-defective chromatic number. (English)
Discrete Math. 311, No. 13, 1119-1127 (2011).
2
A retail category management model integrating shelf space and inventory levels. (English)
Asia-Pac. J. Oper. Res. 26, No. 4, 457-478 (2009).
3
Decision support tool for retail shelf space optimization. (English)
Int. J. Inf. Technol. Decis. Mak. 7, No. 3, 547-565 (2008).
4
Exact algorithms for a one-defective vertex colouring problem. (English)
Neogy, S. K. (ed.) et al., Mathematical programming and game theory for decision making. Hackensack, NJ: World Scientific (ISBN 978-981-281-321-3/hbk; 978-981-281-322-0/ebook). Statistical Science and Interdisciplinary Research 1, 99-111 (2008).
5
Efficient mining of high utility itemsets from large datasets. (English)
Washio, Takashi (ed.) et al., Advances in knowledge discovery and data mining. 12th Pacific-Asia conference, PAKDD 2008 Osaka, Japan, May 20‒23, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-68124-3/pbk). Lecture Notes in Computer Science 5012. Lecture Notes in Artificial Intelligence, 554-561 (2008).
6
Decision support tool for retail shelf space optimization (English)
International Journal of Information Technology and Decision Making 7, No. 3, 547-565 (2008).
7
Efficient mining of high utility itemsets from large datasets (English)
PAKDD, 554-561 (2008).
8
CTU-mine: an efficient high utility itemset mining algorithm using the pattern growth approach (English)
CIT, 71-76 (2007).
9
A bottom-up projection based algorithm for mining high utility itemsets (English)
AIDM, 3-10 (2007).
10
Mining value-based item packages - an integer programming approach (English)
Selected Papers from AusDM, 78-89 (2006).
11
On the Nordhaus-Gaddum problem for the K-defective chromatic number of a graph. (English)
Ray Chaudhuri, D. K. (ed.) et al., Extended abstracts from the R. C. Bose centenary symposium on discrete mathematics and applications, Kolkata, India, December 20‒23, 2002. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 15, 13-15 (2003).
12
On the number of cut edges in a regular graph. (English)
Australas. J. Comb. 27, 5-12 (2003).
13
Single item multi-period multi-retailer inventory replenishment problem with restricted order size (English)
Electronic Notes in Discrete Mathematics 15, 16-19 (2003).
14
On the nordhaus-gaddum problem for the k-defective chromatic number of a graph (English)
Electronic Notes in Discrete Mathematics 15, 13-15 (2003).
15
An improved branch - and - cut algorithm for the capacitated vehicle routing problem (English)
Transportation Science 37, No. 2, 153-169 (2003).
16
Project scheduling under time dependent costs ‒ a branch and bound algorithm. (English)
Ann. Oper. Res. 108, 55-74 (2001).
17
On the vertex arboricity of graphs with prescribed size. (English)
Australas. J. Comb. 19, 17-36 (1999).
18
On the Nordhaus-Gaddum problem for the $n$-path-chromatic number of a graph. (English)
J. Comb. Math. Comb. Comput. 27, 107-115 (1998).
19
Capacitated vehicle routing problem: Some new cutting planes. (English)
Asia-Pac. J. Oper. Res. 15, No.1, 109-123 (1998).
20
Result 1 to 20 of 38 total
Start
Contact
Print
General Help
