J. Comb. Optim.

Keyphrases

Publications

volume 48, number 1, 2024

Marc Demange, Marcel Adonis Haddad, Cécile Murat
Approximating the probabilistic p-Center problem under pressure. J. Comb. Optim. 48 (1) (2024)
Koji M. Kobayashi, Ying Li
An improved upper bound for the online graph exploration problem on unicyclic graphs. J. Comb. Optim. 48 (1) (2024)
Renzo Gómez, Flávio Keidi Miyazawa, Yoshiko Wakabayashi
Polynomial algorithms for sparse spanners on subcubic graphs. J. Comb. Optim. 48 (1) (2024)
Parikshit Das, Kinkar Chandra Das, Sourav Mondal, Anita Pal
First zagreb spectral radius of unicyclic graphs and trees. J. Comb. Optim. 48 (1) (2024)
Mateus Martin, Horacio Hideki Yanasse, Maristela Oliveira Santos, Reinaldo Morabito
Models for two-dimensional bin packing problems with customer order spread. J. Comb. Optim. 48 (1) (2024)
Shengminjie Chen, Donglei Du, Wenguo Yang, Suixiang Gao
Maximizing stochastic set function under a matroid constraint from decomposition. J. Comb. Optim. 48 (1) (2024)
Jin'an He, Fangping Peng, Xiuying Xie
Risk-adjusted exponential gradient strategies for online portfolio selection. J. Comb. Optim. 48 (1) (2024)
Juhi Chaudhary, Sounaka Mishra, B. S. Panda
On the complexity of minimum maximal acyclic matchings. J. Comb. Optim. 48 (1) (2024)
Fatemeh Ehsani, Monireh Hosseini
Customer churn prediction using a novel meta-classifier: an investigation on transaction, Telecommunication and customer churn datasets. J. Comb. Optim. 48 (1) (2024)
Takumi Gomyou, Toshimasa Kobayashi, Takefumi Kondo, Shin Nayatani
Embedding and the first Laplace eigenvalue of a finite graph. J. Comb. Optim. 48 (1) (2024)
Qi-Xia Yang, Long-Cheng Liu, Min Huang, Tian-Run Wang
Algorithms for a two-machine no-wait flow shop scheduling problem with two competing agents. J. Comb. Optim. 48 (1) (2024)

volume 47, number 3, 2024

volume 47, number 4, 2024

volume 47, number 5, 2024