Discrete Optimization

Papers
(The TQCC of Discrete Optimization is 1. 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.)
ArticleCitations
A theoretical justification of the set covering greedy heuristic of Caprara et al.11
Optimal partitions of the flat torus into parts of smaller diameter11
Editorial Board10
An improved greedy algorithm for stochastic online scheduling on unrelated machines9
A criterion space search feasibility pump heuristic for solving maximum multiplicative programs8
Editorial Board7
Approximation schemes for Min-Sum k-Clustering6
Editorial Board6
Secretary and online matching problems with machine learned advice5
The packing number of cubic graphs5
On cut polytopes and graph minors5
The Arc-Item-Load and Related Formulations for the Cumulative Vehicle Routing Problem4
Corrigendum to “Bilevel time minimizing transportation problem” [Discrete Optim.] 5 (4) (2008) 714–7234
Two-set inequalities for the binary knapsack polyhedra4
Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations4
Packing strong subgraph in digraphs4
Valid inequalities for the Time-Indexed Non-Preemptive Single Machine Scheduling Problem4
On Pareto optimal balanced exchanges3
Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan3
Circuits in extended formulations3
Editorial Board2
Editorial Board2
Circuit and Graver walks and linear and integer programming2
Hard problems on box-totally dual integral polyhedra2
Constructing extremal triangle-free graphs using integer programming2
EPTAS for load balancing problem on parallel machines with a non-renewable resource2
LP-based approximation for uniform capacitated facility location problem2
Approximating single- and multi-objective nonlinear sum and product knapsack problems2
The 1
Editorial Board1
Easy and hard separation of sparse and dense odd-set constraints in matching1
Finding the dimension of a non-empty orthogonal array polytope1
On non-superperfection of edge intersection graphs of paths1
The polytope of binary sequences with bounded variation1
Computational aspects of lifted cover inequalities for knapsacks with few different weights1
The non-stop disjoint trajectories problem1
Fractional Decomposition Tree Algorithm: A tool for studying the integrality gap of Integer Programs1
Editorial Board1
Parametric matroid interdiction1
Maximizing the Mostar index for bipartite graphs and split graphs1
Linear time algorithm for the vertex-edge domination problem in convex bipartite graphs1
More on online weighted edge coloring1
On the Rényi–Ulam game with restricted size queries1
Packing mixed hyperarborescences1
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 degree1
On polytopes with linear rank with respect to generalizations of the split closure1
Column (and row) generation algorithms for the pallet loading problem1
A polyhedral study for the cubic formulation of the unconstrained traveling tournament problem1
0.044353008270264