On the public citation graph
A note on some computationally difficult set covering problems
0 signed · 37 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 this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bfb0120689openalex-snapshot
Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systems
inferredcites →https://doi.org/10.1137/0206046openalex-snapshot
Determining the Stability Number of a Graph
inferredcites →https://doi.org/10.1137/0208001openalex-snapshot
Determining the Chromatic Number of a Graph
inferredcites →https://doi.org/10.1145/800119.803893openalex-snapshot
On the lengths of proofs in the propositional calculus (Preliminary Version)
inferredcites →https://doi.org/10.1287/moor.4.3.233openalex-snapshot
A Greedy Heuristic for the Set-Covering Problem
inferredcites →https://doi.org/10.1287/opre.17.3.437openalex-snapshot
An Improved Implicit Enumeration Approach for Integer Programming
inferredcites →https://doi.org/10.1287/opre.19.4.998openalex-snapshot
Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-59408-6_50openalex-snapshot
Use of hidden network structure in the set partitioning problem
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_9openalex-snapshot
Applications of Set Covering, Set Packing and Set Partitioning Models: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-540-68891-4_16openalex-snapshot
Constraint Orbital Branching
inferred← citeshttps://doi.org/10.1007/bf01299447openalex-snapshot
An exact algorithm for the maximum stable set problem
inferred← citeshttps://doi.org/10.1007/bf01582907openalex-snapshot
An interior point algorithm to solve computationally difficult set covering problems
inferred← citeshttps://doi.org/10.1007/bf02099703openalex-snapshot
An algorithm for large scale 0–1 integer programming with application to airline crew scheduling
inferred← citeshttps://doi.org/10.1007/s10107-003-0394-6openalex-snapshot
Exploiting orbits in symmetric ILP
inferred← citeshttps://doi.org/10.1007/s10878-013-9612-1openalex-snapshot
A set covering approach for multi-depot train driver scheduling
inferred← citeshttps://doi.org/10.1007/s11047-016-9609-7openalex-snapshot
Solving the non-unicost set covering problem by using cuckoo search and black hole optimization
inferred← citeshttps://doi.org/10.1007/s11590-010-0225-7openalex-snapshot
Russian doll search for the Steiner triple covering problem
inferred← citeshttps://doi.org/10.1007/s11590-011-0285-3openalex-snapshot
A biased random-key genetic algorithm for the Steiner triple covering problem
inferred← citeshttps://doi.org/10.1016/0167-6377(89)90002-3openalex-snapshot
A probabilistic heuristic for a computationally difficult set covering problem
inferred← citeshttps://doi.org/10.1016/0167-6377(95)00034-hopenalex-snapshot
Solving hard set covering problems
inferred← citeshttps://doi.org/10.1016/0305-0483(90)90066-iopenalex-snapshot
Set covering and set partitioning: A collection of test problems
inferred← citeshttps://doi.org/10.1016/0377-2217(89)90471-2openalex-snapshot
A network relaxation based enumeration algorithm for set partitioning
inferred← citeshttps://doi.org/10.1016/0377-2217(95)00243-xopenalex-snapshot
The design of a 0–1 integer optimizer and its application in the Carmen system
inferred← citeshttps://doi.org/10.1016/j.cor.2008.12.006openalex-snapshot
Solving multiple scenarios in a combinatorial auction
inferred← citeshttps://doi.org/10.1016/j.cor.2011.07.006openalex-snapshot
Measuring instance difficulty for combinatorial optimization problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2010.02.008openalex-snapshot
Surrogate constraint normalization for the set covering problem
inferred← citeshttps://doi.org/10.1016/j.jspi.2006.12.003openalex-snapshot
Classification of orthogonal arrays by integer programming
inferred← citeshttps://doi.org/10.1016/j.orl.2011.02.001openalex-snapshot
Solving large Steiner Triple Covering Problems
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)80440-1openalex-snapshot
Improved solutions to the Steiner triple covering problem
inferred← citeshttps://doi.org/10.1016/s0377-2217(97)00294-4openalex-snapshot
A tabu search approach to the constraint satisfaction problem as a general problem solver
inferred← citeshttps://doi.org/10.1023/a:1018953006796openalex-snapshot
Reformulation of the set partitioning problem as apure network with special order set constraints
inferred← citeshttps://doi.org/10.1023/a:1019293017474openalex-snapshot
Parallel Integer Optimization for Crew Scheduling
inferred← citeshttps://doi.org/10.1111/j.1475-3995.2004.00480.xopenalex-snapshot
A combinatorial auction improves school meals in Chile: a case of OR in developing countries
inferred← citeshttps://doi.org/10.1137/0212021openalex-snapshot
The Worst and the Most Probable Performance of a Class of Set-Covering Algorithms
inferred← citeshttps://doi.org/10.1145/66443.66446openalex-snapshot
Applications of combinatorial designs in computer science
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.