Discret. Optim.

Keyphrases

Publications

volume 50, 2023

K. Subramani, Piotr Wojciechowski
Optimal length cutting plane refutations of integer programs. Discret. Optim. 50 (2023)
Rui Chen, Sanjeeb Dash, Oktay Günlük
Convexifying multilinear sets with cardinality constraints: Structural properties, nested case and extensions. Discret. Optim. 50 (2023)
Haoran Zhu
The k-aggregation closure for covering sets. Discret. Optim. 50 (2023)
Chaohui Chen, Wenshui Lin
On the general Z-type index of connected graphs. Discret. Optim. 50 (2023)
Patrick Chervet, Roland Grappe, Mathieu Lacroix, Francesco Pisanu, Roberto Wolfler Calvo
Hard problems on box-totally dual integral polyhedra. Discret. Optim. 50 (2023)
Zoltán Szigeti
Packing mixed hyperarborescences. Discret. Optim. 50 (2023)
Shunhai He, Huiqing Liu
The maximum number of short paths in a Halin graph. Discret. Optim. 50 (2023)
Ali Erdem Banak, Tínaz Ekim, Z. Caner Taskin
Constructing extremal triangle-free graphs using integer programming. Discret. Optim. 50 (2023)
Leah Epstein
More on online weighted edge coloring. Discret. Optim. 50 (2023)
Konstantinos Kaparis, Adam N. Letchford, Ioannis Mourtos
On cut polytopes and graph minors. Discret. Optim. 50 (2023)

volume 49, 2023

Daniel Bienstock, Gonzalo Muñoz, Sebastian Pokutta
Principled deep neural network training through linear programming. Discret. Optim. 49 (2023)

volume 48, number Part 1, 2023

Natalia de Castro, María Ángeles Garrido, Rafael Robles, María Trinidad Villar-Liñán
Minimum gradation in greyscales of graphs. Discret. Optim. 48 (Part 1) (2023)
Christoph Buchheim, Maja Hügging
The polytope of binary sequences with bounded variation. Discret. Optim. 48 (Part 1) (2023)
Jan Boeckmann, Clemens Thielen, Ulrich Pferschy
Approximating single- and multi-objective nonlinear sum and product knapsack problems. Discret. Optim. 48 (Part 1) (2023)
Piotr Wojciechowski, K. Subramani, Alvaro Velasquez
Reachability in choice networks. Discret. Optim. 48 (Part 1) (2023)
Stefko Miklavic, Johannes Pardey, Dieter Rautenbach, Florian Werner
Maximizing the Mostar index for bipartite graphs and split graphs. Discret. Optim. 48 (Part 1) (2023)
Ádám Fraknói, Dávid Á. Márton, Dániel G. Simon, Dániel Lenger
On the Rényi-Ulam game with restricted size queries. Discret. Optim. 48 (Part 1) (2023)
G. Jaykrishnan, Asaf Levin
EPTAS for load balancing problem on parallel machines with a non-renewable resource. Discret. Optim. 48 (Part 1) (2023)
Florian Hörsch, Zoltán Szigeti
The complexity of 2-vertex-connected orientation in mixed graphs. Discret. Optim. 48 (Part 1) (2023)

volume 48, number Part 2, 2023

Gábor Bacsó, Bostjan Bresar, Kirsti Kuenzel, Douglas F. Rall
Graphs with equal Grundy domination and independence number. Discret. Optim. 48 (Part 2) (2023)
Antonios Antoniadis, Themis Gouleakis, Pieter Kleer, Pavel Kolev
Secretary and online matching problems with machine learned advice. Discret. Optim. 48 (Part 2) (2023)

volume 47, 2023

volume 46, 2022

volume 45, 2022

volume 44, number Part, 2022

Piyashat Sripratak, Abraham P. Punnen, Tamon Stephen
The Bipartite Boolean Quadric Polytope. Discret. Optim. 44 (Part) (2022)
Abraham P. Punnen, Renata Sotirov
Preface: Quadratic combinatorial optimization problems. Discret. Optim. 44 (Part) (2022)
Tomas Gavenciak, Martin Koutecký, Dusan Knop
Integer programming in parameterized complexity: Five miniatures. Discret. Optim. 44 (Part) (2022)
Jaime E. González, André A. Ciré, Andrea Lodi, Louis-Martin Rousseau
BDD-based optimization for the quadratic stable set problem. Discret. Optim. 44 (Part) (2022)
Xunhao Gu, Songzheng Zhao, Yang Wang
Reinforcement learning enhanced multi-neighborhood tabu search for the max-mean dispersion problem. Discret. Optim. 44 (Part) (2022)
Amit Verma, Mark W. Lewis
Penalty and partitioning techniques to improve performance of QUBO solvers. Discret. Optim. 44 (Part) (2022)
Vilmar Jefté Rodrigues de Sousa, Miguel F. Anjos, Sébastien Le Digabel
Computational study of a branching algorithm for the maximum k-cut problem. Discret. Optim. 44 (Part) (2022)