default search action
Discrete Optimization, Volume 44
Volume 44, Number Part 1, May 2022
- Károly Bezdek:
On the intrinsic volumes of intersections of congruent balls. 100539 - Steffen Borgwardt, Charles Viss:
Circuit walks in integral polyhedra. 100566 - Daniel Bienstock, Yuri Faenza, Igor Malinovic, Monaldo Mastrolilli, Ola Svensson, Mark Zuckerberg:
On inequalities with bounded coefficients and pitch for the min knapsack polytope. 100567 - Tomas Gavenciak, Martin Koutecký, Dusan Knop:
Integer programming in parameterized complexity: Five miniatures. 100596 - Digvijay Boob, Santanu S. Dey, Guanghui Lan:
Complexity of training ReLU neural network. 100620 - Martin Koutecký, Asaf Levin, Syed Mohammad Meesum, Shmuel Onn:
Approximate separable multichoice optimization over monotone systems. 100629 - Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto:
Submodular reassignment problem for reallocating agents to tasks with synergy effects. 100631 - Piyashat Sripratak, Abraham P. Punnen, Tamon Stephen:
The Bipartite Boolean Quadric Polytope. 100657 - Antoine Deza, Frédéric Meunier, Tal Raviv:
Preface: Optimization and Discrete Geometry. 100658
Volume 44, Number Part 2, May 2022
- Franklin Djeumou Fomeni, Konstantinos Kaparis, Adam N. Letchford:
A cut-and-branch algorithm for the Quadratic Knapsack Problem. 100579 - Amit Verma, Mark W. Lewis:
Penalty and partitioning techniques to improve performance of QUBO solvers. 100594 - Jaime E. González, André A. Ciré, Andrea Lodi, Louis-Martin Rousseau:
BDD-based optimization for the quadratic stable set problem. 100610 - Daniel Brosch, Etienne de Klerk:
Minimum energy configurations on a toric lattice as a quadratic assignment problem. 100612 - Xiaolu Liu, Jiaming Chen, Minghui Wang, Yang Wang, Zhouxing Su, Zhipeng Lü:
A two-phase tabu search based evolutionary algorithm for the maximum diversity problem. 100613 - Nicolò Gusmeroli, Angelika Wiegele:
EXPEDIS: An exact penalty method over discrete sets. 100622 - Xunhao Gu, Songzheng Zhao, Yang Wang:
Reinforcement learning enhanced multi-neighborhood tabu search for the max-mean dispersion problem. 100625 - Vilmar Jefté Rodrigues de Sousa, Miguel F. Anjos, Sébastien Le Digabel:
Computational study of a branching algorithm for the maximum k-cut problem. 100656 - Abraham P. Punnen, Renata Sotirov:
Preface: Quadratic combinatorial optimization problems. 100688
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.