OOIR: Observatory of International Research

Papers

(The median citation count of Discrete Optimization is 0. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2020-11-01 to 2024-11-01.)

Article	Citations
Complexity of training ReLU neural network	33
Penalty and partitioning techniques to improve performance of QUBO solvers	28
Single-machine scheduling with maintenance activities and rejection	19
Hardness results for Multimarginal Optimal Transport problems	12
Integer programming in parameterized complexity: Five miniatures	11
A cut-and-branch algorithm for the Quadratic Knapsack Problem	8
EXPEDIS: An exact penalty method over discrete sets	7
An exact cutting plane method for k-submodular function maximizatio	6
Principled deep neural network training through linear programming	6
On the edge capacitated Steiner tree problem	5
Network reliability in hamiltonian graphs	5
On bin packing with clustering and bin packing with delays	5
A two-phase tabu search based evolutionary algorithm for the maximum diversity problem	5
Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan	5
Improved algorithms for two-agent scheduling on an unbounded serial-batching machine	4
The Aα	4
Packing strong subgraph in digraphs	4
The Bipartite Boolean Quadric Polytope	4
An improved zig zag approach for competitive group testing	4
BDD-based optimization for the quadratic stable set problem	4
Decentralized algorithms for distributed integer programming problems with a coupling cardinality constraint	3
Stable allocations and partially ordered sets	3
A column generation approach to the discrete barycenter problem	3
Node-based valid inequalities for the optimal transmission switching problem	3
The Arc-Item-Load and Related Formulations for the Cumulative Vehicle Routing Problem	3

Minimum energy configurations on a toric lattice as a quadratic assignment problem	3
Strong IP formulations need large coefficients	3
Block-structured integer programming: Can we parameterize without the largest coefficient?	3
Quality of equilibria for selfish bin packing with cost sharing variants	3
Mathematical formulations and solution methods for the uncapacitated r	3
Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes	2
A polyhedral study of lifted multicuts	2
Constant factor approximation for tracking paths and fault tolerant feedback vertex set	2
Approximating single- and multi-objective nonlinear sum and product knapsack problems	2
Maximizing the Mostar index for bipartite graphs and split graphs	2
A convex cover for closed unit curves has area at least 0.1	2
The polytope of binary sequences with bounded variation	2
Fast constructive and improvement heuristics for edge clique covering	2
On the intrinsic volumes of intersections of congruent balls	2
Parallelization of a branch-and-bound algorithm for the maximum weight clique problem	2
Arc-routing for winter road maintenance	2
Reinforcement learning enhanced multi-neighborhood tabu search for the max-mean dispersion problem	2
On the analysis of optimization problems in arc-dependent networks	2
The p-center problem under locational uncertainty of demand points	1
Cardinality constrained connected balanced partitions of trees under different criteria	1
Fashion game on graphs	1
Constructing extremal triangle-free graphs using integer programming	1
An improved greedy algorithm for stochastic online scheduling on unrelated machines	1
Graphs with equal Grundy domination and independence number	1
GO-MOCE: Greedy Order Method of Conditional Expectations for Max Sat	1
Facets of the dynamic monopoly polytope: Linear ordering formulation	1
Minimum 0-extension problems on directed metrics	1
Secretary and online matching problems with machine learned advice	1
Characterizing linearizable QAPs by the level-1 reformulation-linearization technique	1
Exact values of defective Ramsey numbers in graph classes	1
Circuit walks in integral polyhedra	1
Probabilistic characterization of random Max r-Sat	1
On inequalities with bounded coefficients and pitch for the min knapsack polytope	1
On optimal randomized group testing with one defective item and a constrained number of positive responses	1
Linear programming based approximation for unweighted induced matchings—Breaking the Δ	1
Circuits in extended formulations	1
Tight bounds on the relative performances of pricing optimization mechanisms in storable good markets	0
Scheduling split intervals with non-uniform demands	0
Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles	0
Editorial Board	0
Editorial Board	0
On the length of L-Grundy sequences	0
Editorial Board	0
Optimal length cutting plane refutations of integer programs	0
Convexifying multilinear sets with cardinality constraints: Structural properties, nested case and extensions	0
Editorial Board	0
Editorial Board	0
Editorial Board	0
Tighter bounds on the minimum broadcast time	0
Approximation schemes for Min-Sum k-Clustering	0

Easy and hard separation of sparse and dense odd-set constraints in matching	0
Anchor-robust project scheduling with non-availability periods	0
On cut polytopes and graph minors	0
Finding the dimension of a non-empty orthogonal array polytope	0
The k-aggregation closure for covering sets	0
Two-set inequalities for the binary knapsack polyhedra	0
Vehicle routing with time-dependent travel times: Theory, practice, and benchmarks	0
Editorial Board	0
Reachability in choice networks	0
The complexity of 2-vertex-connected orientation in mixed graphs	0
Editorial Board	0
The optimal proper connection number of a graph with given independence number	0
The (d0
Parametric matroid interdiction	0
Greedy algorithm for local heating problem	0
Editorial Board	0
On packing time-respecting arborescences	0
The maximum number of short paths in a Halin graph	0
Editorial Board	0
Editorial Board	0
Editorial Board	0
Avoiding redundant columns by adding classical Benders cuts to column generation subproblems	0
Mostar index and bounded maximum degree	0
Two-machine job shop problem with a single server and sequence-independent non-anticipatory set-up times	0
The non-stop disjoint trajectories problem	0
Approximate separable multichoice optimization over monotone systems	0
Packing mixed hyperarborescences	0
Editorial Board	0
On the general Z-type index of connected graphs	0
CHAMP: A multipass algorithm for Max Sat based on saver variables	0
When greedy gives optimal: A unified approach	0
Editorial Board	0
Valid inequalities for quadratic optimisation with domain constraints	0
The Aα	0
On the Rényi–Ulam game with restricted size queries	0
Circuit and Graver walks and linear and integer programming	0
Submodular reassignment problem for reallocating agents to tasks with synergy effects	0
Editorial Board	0
LP-based approximation for uniform capacitated facility location problem	0
A polyhedral study for the cubic formulation of the unconstrained traveling tournament problem	0
Minimum gradation in greyscales of graphs	0
Hard problems on box-totally dual integral polyhedra	0
More on online weighted edge coloring	0
Computational study of a branching algorithm for the maximum k-cut	0
Parameterized algorithms for generalizations of Directed Feedback Vertex Set	0
Editorial Board	0
Editorial Board	0
The packing number of cubic graphs	0
Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations	0
Editorial Board	0
Fleet & tail assignment under uncertainty	0
EPTAS for load balancing problem on parallel machines with a non-renewable resource	0
Preface: Quadratic combinatorial optimization problems	0
On Pareto optimal balanced exchanges	0
On non-superperfection of edge intersection graphs of paths	0
Fractional Decomposition Tree Algorithm: A tool for studying the integrality gap of Integer Programs	0
On polytopes with linear rank with respect to generalizations of the split closure	0
Rational polyhedral outer-approximations of the second-order cone	0
Preface: Optimization and Discrete Geometry	0
A theoretical justification of the set covering greedy heuristic of Caprara et al.	0