On the public citation graph
Progress in Combinatorial Optimization.
0 signed · 158 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0537openalex-snapshot
Disjunctive Inequalities: Applications And Extensions
inferred← citeshttps://doi.org/10.1002/mcda.1574openalex-snapshot
Easy to say they are Hard, but Hard to see they are Easy- Towards a Categorization of Tractable Multiobjective Combinatorial Optimization Problems
inferred← citeshttps://doi.org/10.1002/nav.20352openalex-snapshot
On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation
inferred← citeshttps://doi.org/10.1002/net.21693openalex-snapshot
Robust models for linear programming with uncertain right hand side
inferred← citeshttps://doi.org/10.1002/net.21760openalex-snapshot
New path elimination constraints for multi‐depot routing problems
inferred← citeshttps://doi.org/10.1002/net.21765openalex-snapshot
Combining and projecting flow models for the (precedence constrained) asymmetric traveling salesman problem
inferred← citeshttps://doi.org/10.1002/net.22070openalex-snapshot
Affine routing for robust network design
inferred← citeshttps://doi.org/10.1006/jagm.1999.1046openalex-snapshot
Polynomial-Time Analysis of Toroidal Periodic Graphs
inferred← citeshttps://doi.org/10.1006/jctb.1999.1940openalex-snapshot
Maximum Balanced Flow in a Network
inferred← citeshttps://doi.org/10.1007/11671541_9openalex-snapshot
List Scheduling in Order of α-Points on a Single Machine
inferred← citeshttps://doi.org/10.1007/11841036_47openalex-snapshot
Approximation in Preemptive Stochastic Online Scheduling
inferred← citeshttps://doi.org/10.1007/3-540-44450-5_37openalex-snapshot
Scheduling to Minimize the Average Completion Time of Dedicated Tasks
inferred← citeshttps://doi.org/10.1007/3-540-45535-3_28openalex-snapshot
A (2+ε)-Approximation Algorithm for Generalized Preemptive Open Shop Problem with Minsum Objective
inferred← citeshttps://doi.org/10.1007/3-540-48777-8_22openalex-snapshot
Integral Polyhedra Associated with Certain Submodular Functions Defined on 012-Vectors
inferred← citeshttps://doi.org/10.1007/3-540-55488-2_21openalex-snapshot
Processing of hierarchically defined graphs and graph families
inferred← citeshttps://doi.org/10.1007/3-540-57182-5_66openalex-snapshot
Paths and cycles in finite periodic graphs
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_194openalex-snapshot
Periodic and non-periodic min-max equations
inferred← citeshttps://doi.org/10.1007/978-1-349-11570-9_4openalex-snapshot
A Constructive Approach to Economic Fluctuations
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_57openalex-snapshot
Dual Integrality in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_25openalex-snapshot
A Review of Machine Scheduling: Complexity, Algorithms and Approximability
inferred← citeshttps://doi.org/10.1007/978-1-4613-8354-3_2openalex-snapshot
Mixed Matrices: Irreducibility and Decomposition
inferred← citeshttps://doi.org/10.1007/978-1-4613-8354-3_5openalex-snapshot
Eigenvalues in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4614-8588-9_2openalex-snapshot
Lower and Upper Bounds for the Preemptive Single Machine Scheduling Problem with Equal Processing Times
inferred← citeshttps://doi.org/10.1007/978-1-4615-5775-3_12openalex-snapshot
Flow Line Scheduling by Tabu Search
inferred← citeshttps://doi.org/10.1007/978-1-4684-9199-9_1openalex-snapshot
Origins and basic concepts
inferred← citeshttps://doi.org/10.1007/978-1-4757-3145-3_18openalex-snapshot
On the Efficient Approximability of “HARD” Problems: A Survey
inferred← citeshttps://doi.org/10.1007/978-1-4939-3094-4_19openalex-snapshot
Exact Methods for Multi-Objective Combinatorial Optimisation
inferred← citeshttps://doi.org/10.1007/978-1-84882-310-5_4openalex-snapshot
Classic Scheduling Theory
inferred← citeshttps://doi.org/10.1007/978-3-319-45587-7_4openalex-snapshot
Reducing the Clique and Chromatic Number via Edge Contractions and Vertex Deletions
inferred← citeshttps://doi.org/10.1007/978-3-540-45077-1_6openalex-snapshot
Scheduling to Minimize Max Flow Time: Offline and Online Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-48413-4_28openalex-snapshot
Scheduling on a Constant Number of Machines
inferred← citeshttps://doi.org/10.1007/978-3-540-68279-0_14openalex-snapshot
Integer Programming and Algorithmic Geometry of Numbers
inferred← citeshttps://doi.org/10.1007/978-3-540-76796-1_3openalex-snapshot
Antimatroids, Betweenness, Convexity
inferred← citeshttps://doi.org/10.1007/978-3-540-76796-1_6openalex-snapshot
A Survey on Covering Supermodular Functions
inferred← citeshttps://doi.org/10.1007/978-3-540-76796-1_7openalex-snapshot
Theory of Principal Partitions Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-03351-3_6openalex-snapshot
Integrality Property in Preemptive Parallel Machine Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-642-15369-3_16openalex-snapshot
Matrix Sparsification and the Sparse Null Space Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-17514-5_24openalex-snapshot
Increasing Speed Scheduling and Flow Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-642-33996-7_18openalex-snapshot
Congestion Games with Capacitated Resources
inferred← citeshttps://doi.org/10.1007/978-3-642-61684-6_5openalex-snapshot
Maschinenbelegungsplanung
inferred← citeshttps://doi.org/10.1007/978-3-642-79034-8_4openalex-snapshot
Single Processor Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-642-87729-2_8openalex-snapshot
Auswahl von theoriebezogenen Veröffentlichungen
inferred← citeshttps://doi.org/10.1007/978-3-662-03217-6_4openalex-snapshot
Scheduling on One Processor
inferred← citeshttps://doi.org/10.1007/978-3-662-03217-6_5openalex-snapshot
Scheduling on Parallel Processors
inferred← citeshttps://doi.org/10.1007/bf01586042openalex-snapshot
Optimal partitions having disjoint convex and conic hulls
inferred← citeshttps://doi.org/10.1007/bfb0083463openalex-snapshot
Examples and algorithmic properties of greedoids
inferred← citeshttps://doi.org/10.1007/bfb0121005openalex-snapshot
A submodular network simplex method
inferred← citeshttps://doi.org/10.1007/bfb0121049openalex-snapshot
Basis graphs of greedoids and two-connectivity
inferred← citeshttps://doi.org/10.1007/s00170-006-0810-1openalex-snapshot
Optimal parallel machines scheduling with machine availability and eligibility constraints
inferred← citeshttps://doi.org/10.1007/s10107-007-0103-yopenalex-snapshot
The complexity of recognizing linear systems with certain integrality properties
inferred← citeshttps://doi.org/10.1007/s10107-015-0891-4openalex-snapshot
On mathematical programming with indicator constraints
inferred← citeshttps://doi.org/10.1007/s10107-018-1239-7openalex-snapshot
Polytopes associated with symmetry handling
inferred← citeshttps://doi.org/10.1007/s10472-004-9418-zopenalex-snapshot
On Exact Selection of Minimally Unsatisfiable Subformulae
inferred← citeshttps://doi.org/10.1007/s10479-013-1371-yopenalex-snapshot
Robust delay-constrained routing in telecommunications
inferred← citeshttps://doi.org/10.1007/s10479-016-2360-8openalex-snapshot
A bi-objective approach to discrete cost-bottleneck location problems
inferred← citeshttps://doi.org/10.1007/s10479-019-03298-9openalex-snapshot
Modeling single machine preemptive scheduling problems for computational efficiency
inferred← citeshttps://doi.org/10.1007/s10479-019-03380-2openalex-snapshot
Knapsack polytopes: a survey
inferred← citeshttps://doi.org/10.1007/s10878-025-01289-0openalex-snapshot
A multi-objective perspective on the cable-trench problem
inferred← citeshttps://doi.org/10.1007/s10898-011-9817-8openalex-snapshot
Fenchel decomposition for stochastic mixed-integer programming
inferred← citeshttps://doi.org/10.1007/s10951-008-0078-4openalex-snapshot
Minimizing the stretch when scheduling flows of divisible requests
inferred← citeshttps://doi.org/10.1007/s10951-010-0185-xopenalex-snapshot
Single-machine scheduling with no idle time and release dates to minimize a regular criterion
inferred← citeshttps://doi.org/10.1007/s10951-010-0198-5openalex-snapshot
Minimizing total tardiness on parallel machines with preemptions
inferred← citeshttps://doi.org/10.1007/s10951-011-0231-3openalex-snapshot
Parallel machine problems with equal processing times: a survey
inferred← citeshttps://doi.org/10.1007/s10951-011-0255-8openalex-snapshot
Single machine batch scheduling with release times and delivery costs
inferred← citeshttps://doi.org/10.1016/0012-365x(85)90042-1openalex-snapshot
Interval graphs and interval orders
inferred← citeshttps://doi.org/10.1016/0012-365x(89)90194-5openalex-snapshot
A min-max relation for the partial q- colourings of a graph. Part II: Box perfection
inferred← citeshttps://doi.org/10.1016/0012-365x(90)90321-8openalex-snapshot
Restricted covering of digraphs with arborescences
inferred← citeshttps://doi.org/10.1016/0012-365x(93)90539-6openalex-snapshot
A decomposition for a class of (P5,P5)-free graphs
inferred← citeshttps://doi.org/10.1016/0024-3795(94)00308-4openalex-snapshot
An extension of a theorem of Fulkerson and Gross
inferred← citeshttps://doi.org/10.1016/0095-8956(88)90067-6openalex-snapshot
A characterization of undirected branching greedoids
inferred← citeshttps://doi.org/10.1016/0095-8956(90)90070-gopenalex-snapshot
An intersection theorem for supermatroids
inferred← citeshttps://doi.org/10.1016/0166-218x(86)90046-6openalex-snapshot
Exchange properties of combinatorial closure spaces
inferred← citeshttps://doi.org/10.1016/0166-218x(86)90050-8openalex-snapshot
Polymatroidal flows with lower bounds
inferred← citeshttps://doi.org/10.1016/0166-218x(86)90053-3openalex-snapshot
Duality for balanced submodular flows
inferred← citeshttps://doi.org/10.1016/0166-218x(87)90008-4openalex-snapshot
Menger-decomposition of a graph and its application to the structural analysis of a large-scale system of equations
inferred← citeshttps://doi.org/10.1016/0166-218x(88)90040-6openalex-snapshot
A greedy algorithm for hereditary set systems and a generalization of the Rado-Edmonds characterization of matroids
inferred← citeshttps://doi.org/10.1016/0166-218x(90)90067-mopenalex-snapshot
Principal structure of layered mixed matrices
inferred← citeshttps://doi.org/10.1016/0166-218x(90)90091-popenalex-snapshot
Constrained partitioning problems
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90231-xopenalex-snapshot
Negative circuits for flows and submodular flows
inferred← citeshttps://doi.org/10.1016/0166-218x(93)e0125-iopenalex-snapshot
New results on the completion time variance minimization
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00018-9openalex-snapshot
A theorem on the principal structure for independent matchings
inferred← citeshttps://doi.org/10.1016/0196-8858(85)90021-1openalex-snapshot
Homotopy properties of greedoids
inferred← citeshttps://doi.org/10.1016/0305-0548(86)90048-1openalex-snapshot
Future paths for integer programming and links to artificial intelligence
inferred← citeshttps://doi.org/10.1016/0305-0548(94)00077-lopenalex-snapshot
Parametric formulation of the general integer linear programming problem
inferred← citeshttps://doi.org/10.1016/0898-1221(88)90210-6openalex-snapshot
A parallel algorithm for bisection width in trees
inferred← citeshttps://doi.org/10.1016/0925-5273(95)00086-0openalex-snapshot
Parallel machine scheduling with release dates, due dates and family setup times
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50013-0openalex-snapshot
10.1016/b978-044488002-4/50013-0
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50032-4openalex-snapshot
10.1016/b978-044488002-4/50032-4
inferred← citeshttps://doi.org/10.1016/j.amc.2015.10.058openalex-snapshot
Online scheduling with linear deteriorating jobs to minimize the total weighted completion time
inferred← citeshttps://doi.org/10.1016/j.cor.2005.09.002openalex-snapshot
Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints
inferred← citeshttps://doi.org/10.1016/j.cor.2008.12.010openalex-snapshot
Preemptive scheduling on uniform machines to minimize mean flow time
inferred← citeshttps://doi.org/10.1016/j.cor.2012.07.003openalex-snapshot
An effective lower bound on Lmax in a worker-constrained job shop
inferred← citeshttps://doi.org/10.1016/j.dam.2003.12.011openalex-snapshot
Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing
inferred← citeshttps://doi.org/10.1016/j.dam.2008.03.040openalex-snapshot
Rooted k -connections in digraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2008.05.001openalex-snapshot
The box-TDI system associated with 2-edge connected spanning subgraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2017.07.035openalex-snapshot
Decomposition theorems for square-free 2 -matchings in bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2022.06.015openalex-snapshot
Fair integral submodular flows
inferred← citeshttps://doi.org/10.1016/j.disc.2004.12.023openalex-snapshot
Maps of matroids with applications
inferred← citeshttps://doi.org/10.1016/j.disc.2009.05.024openalex-snapshot
The Strong Perfect Graph Conjecture: 40 years of attempts, and its resolution
inferred← citeshttps://doi.org/10.1016/j.disopt.2007.11.002openalex-snapshot
Nonlinear bipartite matching
inferred← citeshttps://doi.org/10.1016/j.disopt.2021.100624openalex-snapshot
Strong IP formulations need large coefficients
inferred← citeshttps://doi.org/10.1016/j.ejor.2006.11.027openalex-snapshot
Parallel machine scheduling with machine availability and eligibility constraints
inferred← citeshttps://doi.org/10.1016/j.ejor.2013.07.038openalex-snapshot
Requiem for the Miller–Tucker–Zemlin subtour elimination constraints?
inferred← citeshttps://doi.org/10.1016/j.ejor.2015.07.030openalex-snapshot
A branch-and-cut framework for the consistent traveling salesman problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2017.11.063openalex-snapshot
Solving the family traveling salesman problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2025.01.034openalex-snapshot
Fifty years of research in scheduling — Theory and applications
inferred← citeshttps://doi.org/10.1016/j.iot.2025.101540openalex-snapshot
Two-stage robust wireless body area network design
inferred← citeshttps://doi.org/10.1016/j.jda.2005.12.001openalex-snapshot
Online weighted flow time and deadline scheduling
inferred← citeshttps://doi.org/10.1016/j.orl.2003.11.008openalex-snapshot
On-line scheduling to minimize average completion time revisited
inferred← citeshttps://doi.org/10.1016/j.orl.2023.01.003openalex-snapshot
An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint
inferred← citeshttps://doi.org/10.1016/j.orl.2023.09.010openalex-snapshot
Multiprocessor jobs, preemptive schedules, and one-competitive online algorithms
inferred← citeshttps://doi.org/10.1016/j.orl.2024.107144openalex-snapshot
The total matching polytope of complete bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.rcim.2004.07.002openalex-snapshot
Scheduling non-similar groups on a flow line: multiple group setups
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.05.020openalex-snapshot
Complexity and algorithms for constant diameter augmentation problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114318openalex-snapshot
Advice complexity of adaptive priority algorithms
inferred← citeshttps://doi.org/10.1016/s0012-365x(03)00293-0openalex-snapshot
Cayley partitionable graphs and near-factorizations of finite groups
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00178-1openalex-snapshot
On transversals in minimal imperfect graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00078-8openalex-snapshot
On the properties of the subsets of a discrete domain defined by the local optimae of a function endowed with some geometrical properties
inferred← citeshttps://doi.org/10.1016/s0024-3795(97)00375-3openalex-snapshot
Block triangularization of skew-symmetric matrices
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00300-6openalex-snapshot
Matchings in colored bipartite networks
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00318-3openalex-snapshot
K-submodular functions and convexity of their Lovász extension
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00337-7openalex-snapshot
Non-standard approaches to integer programming
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00362-6openalex-snapshot
A framework for the greedy algorithm
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00462-6openalex-snapshot
On the orientation of graphs and hypergraphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(96)00040-6openalex-snapshot
Algorithms for minclique scheduling problems
inferred← citeshttps://doi.org/10.1016/s0166-218x(96)00118-7openalex-snapshot
Optimum partitioning into intersections of ring families
inferred← citeshttps://doi.org/10.1016/s0166-218x(98)00032-8openalex-snapshot
Is a unit-time job shop not easier than identical parallel machines?
inferred← citeshttps://doi.org/10.1016/s0166-218x(98)00063-8openalex-snapshot
Adjacency on the constrained assignment problem
inferred← citeshttps://doi.org/10.1016/s0167-6377(00)00024-9openalex-snapshot
A 1.47-approximation algorithm for a preemptive single-machine scheduling problem
inferred← citeshttps://doi.org/10.1016/s0195-6698(85)80022-6openalex-snapshot
A Note on Selectors and Greedoids
inferred← citeshttps://doi.org/10.1016/s0196-6774(02)00251-1openalex-snapshot
A (2+ε)-approximation algorithm for the generalized preemptive open shop problem with minsum objective
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00241-3openalex-snapshot
Convexity and global optimization: a theoretical link
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00008-4openalex-snapshot
Hierarchically specified unit disk graphs
inferred← citeshttps://doi.org/10.1016/s0305-0548(99)00048-9openalex-snapshot
Scheduling multiprocessor tasks for mean flow time criterion
inferred← citeshttps://doi.org/10.1016/s0377-2217(00)00252-6openalex-snapshot
Greedy solutions of selection and ordering problems
inferred← citeshttps://doi.org/10.1016/s0377-2217(02)00767-1openalex-snapshot
Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
inferred← citeshttps://doi.org/10.1016/s0377-2217(96)00399-2openalex-snapshot
A cutting-plane approach to mixed 0–1 stochastic integer programs
inferred← citeshttps://doi.org/10.1016/s0377-2217(97)00167-7openalex-snapshot
Computational implementation of Fujishige's graph realizability algorithm
inferred← citeshttps://doi.org/10.1016/s0377-2217(97)00260-9openalex-snapshot
The flow shop with parallel machines: A tabu search approach
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80118-5openalex-snapshot
Chapter 1 Applications of network optimization
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80189-6openalex-snapshot
Chapter 9 Sequencing and scheduling: Algorithms and complexity
inferred← citeshttps://doi.org/10.1057/jors.2009.2openalex-snapshot
Fifty years of scheduling: a survey of milestones
inferred← citeshttps://doi.org/10.1080/17509653.2016.1172993openalex-snapshot
Fuzzy greedy search heuristic for combinatorial optimization with specific application to machine scheduling
inferred← citeshttps://doi.org/10.1103/physrevapplied.20.024005openalex-snapshot
Evaluating Spintronics-Compatible Implementations of Ising Machines
inferred← citeshttps://doi.org/10.1109/sfcs.1998.743448openalex-snapshot
A TDI system and its application to approximation algorithms
inferred← citeshttps://doi.org/10.1111/itor.13039openalex-snapshot
Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem
inferred← citeshttps://doi.org/10.1145/28395.28401openalex-snapshot
Testing for cycles in infinite graphs with periodic structure
inferred← citeshttps://doi.org/10.1287/mnsc.2013.1802openalex-snapshot
A Branch and Bound Algorithm for a Class of Biobjective Mixed Integer Programs
inferred← citeshttps://doi.org/10.1287/opre.48.1.99.12447openalex-snapshot
Scheduling with Inserted Idle Time: Problem Taxonomy and Literature Review
inferred← citeshttps://doi.org/10.1287/trsc.2015.0593openalex-snapshot
A Branch-Cut-and-Price Algorithm for the Energy Minimization Vehicle Routing Problem
inferred← citeshttps://doi.org/10.13164/ma.2013.12openalex-snapshot
MATHEMATICAL EVOLUTION IN DISCRETE NETWORKS
inferred← citeshttps://doi.org/10.1590/0101-7438.2019.039.01.0001openalex-snapshot
NEW THEORETICAL INVESTIGATIONS ON THE GAP OF THE SKIVING STOCK PROBLEM
inferred← citeshttps://doi.org/10.3233/978-1-60750-718-5-164openalex-snapshot
Branching on Split Disjunctions
inferred← citeshttps://doi.org/10.4018/978-1-6684-2339-4.ch001openalex-snapshot
An Integrated Intelligent Computation for Complex Problems in Engineering Management
inferred← citeshttps://doi.org/10.4018/ijaec.2017040104openalex-snapshot
An Incorporation of the Fuzzy Greedy Search Heuristic With Evolutionary Approaches for Combinatorial Optimization in Operations Management
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.