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 2021-04-01 to 2025-04-01.)

Article	Citations
On the pure fixed charge transportation problem	35
Node-based valid inequalities for the optimal transmission switching problem	33
On the length of L-Grundy sequences	12
A polyhedral study for the cubic formulation of the unconstrained traveling tournament problem	11
On polytopes with linear rank with respect to generalizations of the split closure	8
A theoretical justification of the set covering greedy heuristic of Caprara et al.	8
When greedy gives optimal: A unified approach	6
Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan	6
Parallelization of a branch-and-bound algorithm for the maximum weight clique problem	5
Submodular reassignment problem for reallocating agents to tasks with synergy effects	5
The Aα	5
EXPEDIS: An exact penalty method over discrete sets	5
The optimal proper connection number of a graph with given independence number	5
Corrigendum to “A polyhedral study of lifted multicuts” [Discrete Optim. 47 (2023) 100757]	4
Maximizing the Mostar index for bipartite graphs and split graphs	4
Exact values of defective Ramsey numbers in graph classes	4
Graphs with equal Grundy domination and independence number	4
Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles	4
Two-set inequalities for the binary knapsack polyhedra	4
Reachability in choice networks	4
Mathematical formulations and solution methods for the uncapacitated r	4
Anchor-robust project scheduling with non-availability periods	3
An improved greedy algorithm for stochastic online scheduling on unrelated machines	3
Integer points in the degree-sequence polytope	3
Packing mixed hyperarborescences	3

Editorial Board	3
Complexity of training ReLU neural network	2
On the general Z-type index of connected graphs	2
Finding the dimension of a non-empty orthogonal array polytope	2
Editorial Board	2
Characterizing linearizable QAPs by the level-1 reformulation-linearization technique	2
On Pareto optimal balanced exchanges	2
Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes	2
On the intrinsic volumes of intersections of congruent balls	2
Circuits in extended formulations	2
EPTAS for load balancing problem on parallel machines with a non-renewable resource	2
On bin packing with clustering and bin packing with delays	2
Secretary and online matching problems with machine learned advice	1
The packing number of cubic graphs	1
Editorial Board	1
Editorial Board	1
Editorial Board	1
Constructing extremal triangle-free graphs using integer programming	1
Circuit and Graver walks and linear and integer programming	1
Approximating single- and multi-objective nonlinear sum and product knapsack problems	1
A cut-and-branch algorithm for the Quadratic Knapsack Problem	1
Hard problems on box-totally dual integral polyhedra	1
Mostar index and bounded maximum degree	1
A column generation approach to the discrete barycenter problem	1
Approximation schemes for Min-Sum k-Clustering	1
Computational study of a branching algorithm for the maximum k-cut	1
Optimal length cutting plane refutations of integer programs	1
On packing time-respecting arborescences	1
Editorial Board	1
Editorial Board	1
Parametric matroid interdiction	1
The complexity of 2-vertex-connected orientation in mixed graphs	0
Editorial Board	0
The (d0
Vehicle routing with time-dependent travel times: Theory, practice, and benchmarks	0
CHAMP: A multipass algorithm for Max Sat based on saver variables	0
Principled deep neural network training through linear programming	0
Generalized min-up/min-down polytopes	0
Preface: Optimization and Discrete Geometry	0
Minimum 0-extension problems on directed metrics	0
Editorial Board	0
The polytope of binary sequences with bounded variation	0
Corrigendum to “Bilevel time minimizing transportation problem” [Discrete Optim.] 5 (4) (2008) 714–723	0
More on online weighted edge coloring	0
Editorial Board	0
On non-superperfection of edge intersection graphs of paths	0
An exact cutting plane method for k-submodular function maximizatio	0
Reinforcement learning enhanced multi-neighborhood tabu search for the max-mean dispersion problem	0
Facets of the dynamic monopoly polytope: Linear ordering formulation	0
On the analysis of optimization problems in arc-dependent networks	0

Two-machine job shop problem with a single server and sequence-independent non-anticipatory set-up times	0
LP-based approximation for uniform capacitated facility location problem	0
Stable allocations and partially ordered sets	0
Editorial Board	0
A polynomial-time algorithm for conformable coloring on regular bipartite and subcubic graphs	0
GO-MOCE: Greedy Order Method of Conditional Expectations for Max Sat	0
BDD-based optimization for the quadratic stable set problem	0
Editorial Board	0
Cardinality constrained connected balanced partitions of trees under different criteria	0
Fractional Decomposition Tree Algorithm: A tool for studying the integrality gap of Integer Programs	0
Network reliability in hamiltonian graphs	0
Preface: Quadratic combinatorial optimization problems	0
Fleet & tail assignment under uncertainty	0
Rational polyhedral outer-approximations of the second-order cone	0
Editorial Board	0
Approximate separable multichoice optimization over monotone systems	0
Minimum gradation in greyscales of graphs	0
Integer programming in parameterized complexity: Five miniatures	0
Editorial Board	0
Tighter bounds on the minimum broadcast time	0
Block-structured integer programming: Can we parameterize without the largest coefficient?	0
Editorial Board	0
Improved algorithms for two-agent scheduling on an unbounded serial-batching machine	0
Easy and hard separation of sparse and dense odd-set constraints in matching	0
On cut polytopes and graph minors	0
An improved zig zag approach for competitive group testing	0
Penalty and partitioning techniques to improve performance of QUBO solvers	0
The maximum number of short paths in a Halin graph	0
The Arc-Item-Load and Related Formulations for the Cumulative Vehicle Routing Problem	0
Editorial Board	0
Circuit walks in integral polyhedra	0
A two-phase tabu search based evolutionary algorithm for the maximum diversity problem	0
Packing strong subgraph in digraphs	0
Constant factor approximation for tracking paths and fault tolerant feedback vertex set	0
Hardness results for Multimarginal Optimal Transport problems	0
Linear time algorithm for the vertex-edge domination problem in convex bipartite graphs	0
Editorial Board	0
On inequalities with bounded coefficients and pitch for the min knapsack polytope	0
Arc-routing for winter road maintenance	0
Valid inequalities for quadratic optimisation with domain constraints	0
The k-aggregation closure for covering sets	0
Convexifying multilinear sets with cardinality constraints: Structural properties, nested case and extensions	0
On the Rényi–Ulam game with restricted size queries	0
The Bipartite Boolean Quadric Polytope	0
Solving hard bi-objective knapsack problems using deep reinforcement learning	0
Parameterized algorithms for generalizations of Directed Feedback Vertex Set	0
Probabilistic characterization of random Max r-Sat	0
Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations	0
Editorial Board	0
Uniform capacitated facility location with outliers/penalties	0
A polyhedral study of lifted multicuts	0
The non-stop disjoint trajectories problem	0
The p-center problem under locational uncertainty of demand points	0
Tight bounds on the relative performances of pricing optimization mechanisms in storable good markets	0
Minimum energy configurations on a toric lattice as a quadratic assignment problem	0