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 2022-06-01 to 2026-06-01.)

Article	Citations
Optimal partitions of the flat torus into parts of smaller diameter	11
A theoretical justification of the set covering greedy heuristic of Caprara et al.	11
Editorial Board	10
An improved greedy algorithm for stochastic online scheduling on unrelated machines	9
A criterion space search feasibility pump heuristic for solving maximum multiplicative programs	8
Editorial Board	7
Approximation schemes for Min-Sum k-Clustering	6
Editorial Board	6
On cut polytopes and graph minors	5
Secretary and online matching problems with machine learned advice	5
The packing number of cubic graphs	5
Packing strong subgraph in digraphs	4
Valid inequalities for the Time-Indexed Non-Preemptive Single Machine Scheduling Problem	4
The Arc-Item-Load and Related Formulations for the Cumulative Vehicle Routing Problem	4
Corrigendum to “Bilevel time minimizing transportation problem” [Discrete Optim.] 5 (4) (2008) 714–723	4
Two-set inequalities for the binary knapsack polyhedra	4
Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations	4
Circuits in extended formulations	3
On Pareto optimal balanced exchanges	3
Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan	3
EPTAS for load balancing problem on parallel machines with a non-renewable resource	2
LP-based approximation for uniform capacitated facility location problem	2
Approximating single- and multi-objective nonlinear sum and product knapsack problems	2
Editorial Board	2
Editorial Board	2

Circuit and Graver walks and linear and integer programming	2
Hard problems on box-totally dual integral polyhedra	2
Constructing extremal triangle-free graphs using integer programming	2
Packing mixed hyperarborescences	1
A remark on the formulation given in “A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for routing problems with time windows”	1
Mostar index and bounded maximum degree	1
On polytopes with linear rank with respect to generalizations of the split closure	1
Column (and row) generation algorithms for the pallet loading problem	1
A polyhedral study for the cubic formulation of the unconstrained traveling tournament problem	1
The	1
Editorial Board	1
Easy and hard separation of sparse and dense odd-set constraints in matching	1
Finding the dimension of a non-empty orthogonal array polytope	1
On non-superperfection of edge intersection graphs of paths	1
The polytope of binary sequences with bounded variation	1
Computational aspects of lifted cover inequalities for knapsacks with few different weights	1
The non-stop disjoint trajectories problem	1
Fractional Decomposition Tree Algorithm: A tool for studying the integrality gap of Integer Programs	1
Editorial Board	1
Parametric matroid interdiction	1
Maximizing the Mostar index for bipartite graphs and split graphs	1
Linear time algorithm for the vertex-edge domination problem in convex bipartite graphs	1
More on online weighted edge coloring	1
On the Rényi–Ulam game with restricted size queries	1
Block-structured integer programming: Can we parameterize without the largest coefficient?	0
On packing time-respecting arborescences	0
Vehicle routing with time-dependent travel times: Theory, practice, and benchmarks	0
Better and simpler reducibility bounds over the integers	0
When greedy gives optimal: A unified approach	0
The k	0
On the integrality gap of small Asymmetric Traveling Salesman Problems: A polyhedral and computational approach	0
Stable allocations and partially ordered sets	0
Editorial Board	0
A polyhedral study of lifted multicuts	0
Inverse of the Gomory corner relaxation of integer programs	0
Computation of lower tolerances of combinatorial bottleneck problems	0
Editorial Board	0
On the pure fixed charge transportation problem	0
Integer points in the degree-sequence polytope	0
The complexity of 2-vertex-connected orientation in mixed graphs	0
Saturation numbers of balanced double stars	0
Minimizing maximum dissatisfaction in the allocation of indivisible items under a common preference graph	0
Constant factor approximation for tracking paths and fault tolerant feedback vertex set	0
Corrigendum to “A polyhedral study of lifted multicuts” [Discrete Optim. 47 (2023) 100757]	0
An efficient solution approach to capacitated bilevel time minimizing transportation problem	0
CHAMP: A multipass algorithm for Max Sat based on saver variables	0
Editorial Board	0
Editorial Board	0
The maximum number of short paths in a Halin graph	0
Solving hard bi-objective knapsack problems using deep reinforcement learning	0

The k-way vertex cut problem on bipartite graphs: Complexity resul	0
Editorial Board	0
Graphs with equal Grundy domination and independence number	0
Fleet & tail assignment under uncertainty	0
On the weak k-metric dimension of Hamming graphs	0
Two-machine job shop problem with a single server and sequence-independent non-anticipatory set-up times	0
Trimming of finite subsets of the Manhattan plane	0
Tighter bounds on the minimum broadcast time	0
Editorial Board	0
The parametric matroid ℓ-interdiction problem	0
The Aα spectral radius of graphs with given independence number n−4	0
An optimization approach to degree deviation and spectral radius	0
The p	0
Editorial Board	0
Editorial Board	0
An improved bound for the price of anarchy for related machine scheduling	0
On degeneracy in the P-matroid oriented matroid complementarity problem	0
Anchor-robust project scheduling with non-availability periods	0
On the general Z	0
On the analysis of optimization problems in arc-dependent networks	0
Cardinality constrained connected balanced partitions of trees under different criteria	0
Parameterized algorithms for generalizations of Directed Feedback Vertex Set	0
The (	0
On the circuit diameter conjecture for counterexamples to the Hirsch conjecture	0
An initial polyhedral study of the football pool problem	0
On the length of L-Grundy sequences	0
Principled deep neural network training through linear programming	0
Lower bounds on the performance of online algorithms for relaxed packing problems	0
Coordinated vehicle platooning on tree networks: Efficient time discretization and strengthened formulation	0
A preprocessing technique for quadratic unconstrained binary optimization	0
Approximation algorithms for the cluster editing problem with small clusters	0
Convexifying multilinear sets with cardinality constraints: Structural properties, nested case and extensions	0
Editorial Board	0
Reachability in choice networks	0
On the number of independent sets in Halin graphs	0
Optimal length cutting plane refutations of integer programs	0
Generalized min-up/min-down polytopes	0
Editorial Board	0
Characterizing linearizable QAPs by the level-1 reformulation-linearization technique	0
Uniform capacitated facility location with outliers/penalties	0
The facets of the subtour polytope	0
Minimum gradation in greyscales of graphs	0
Disjoint dominating and 2-dominating sets in graphs: Hardness and approximation results	0
Exploiting symmetries in optimal quantum circuit design	0
A polynomial-time algorithm for conformable coloring on regular bipartite and subcubic graphs	0
The length polyhedron of an interval order	0