Reference health

Compact representation of near-optimal integer programming solutions

https://doi.org/10.1007/s10107-019-01390-3
CiteStamped reference-health badge
27/27 checkable references clean · checked 2026-08-09

Every reference with a DOI in the deposited reference list resolved to a known work in Crossref or DataCite at the dated check, and none carried a retraction, withdrawal, or removal notice.

11 without a DOI — not checked. A reference deposited without a DOI is never matched by title or guessed at; it stays outside the checked set, and this line discloses that.

The 27 checked references that resolve
resolves10.1109/TC.1978.1675141
Binary Decision Diagrams
resolves10.1007/978-3-540-74970-7_11
A Constraint Store Based on Multivalued Decision Diagrams
resolves10.1023/A:1018570311399
Finding all optimal solutions to the reserve site selection problem: formulation and computational analysis
resolves10.1007/978-3-642-29828-8_3
Variable Ordering for the Application of BDDs to the Maximum Independent Set Problem
resolves10.1287/ijoc.2015.0648
Discrete Optimization with Decision Diagrams
resolves10.1109/12.537122
Improving the variable ordering of OBDDs is NP-complete
resolves10.1109/TC.1986.1676819
Graph-Based Algorithms for Boolean Function Manipulation
resolves10.1287/inte.2014.0754
ASP, The Art and Science of Practice: A (Very) Short Course in Suboptimization
resolves10.1287/opre.48.4.623.12420
Inference-Based Sensitivity Analysis for Mixed Integer/Linear Programming
resolves10.1109/TCAD.2003.819427
An improved branch and bound algorithm for exact bdd minimization
resolves10.1287/ijoc.1090.0329
Pruning Moves
resolves10.1016/0167-6377(88)90025-9
A new dominance procedure for combinatorial optimization problems
resolves10.1287/mnsc.23.5.453
Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming
resolves10.1007/978-1-4615-4567-5_17
Scatter Search to Generate Diverse MIP Solutions
resolves10.1287/mnsc.2014.2076
Compact Bid Languages and Core Pricing in Large Multi-item Auctions
resolves10.1007/s10732-007-9053-z
Experiments concerning sequential versus simultaneous maximization of objective function and distance
resolves10.1007/978-3-642-15396-9_23
A Systematic Approach to MDD-Based Constraint Programming
resolves10.1007/BFb0121213
Three methods for postoptimal analysis in integer linear programming
resolves10.1016/S0304-3975(97)83807-8
Size of ordered binary decision diagrams representing threshold functions
resolves10.1145/322003.322010
The Power of Dominance Relations in Branch-and-Bound Algorithms
resolves10.1016/j.orl.2009.04.001
Approximating the stability region for binary mixed-integer programs
resolves10.1145/321796.321808
Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems
resolves10.1002/j.1538-7305.1959.tb01585.x
Representation of Switching Circuits by Binary-Decision Programs
resolves10.1287/trsc.1040.0112
Updating Paths in Time-Varying Networks Given Arc Weight Changes
resolves10.1287/opre.33.5.1008
Sensitivity Analysis for Branch and Bound Integer Programming
resolves10.1016/S0166-218X(98)00151-6
On the complexity of postoptimality analysis of 01 programs
resolves10.1137/1.9780898719789
Branching Programs and Binary Decision Diagrams
The 11 references without a DOI — listed, not checked
no DOI — not checkedAchterberg, T., Heinz, S., Koch, T.: Counting solutions of integer programs using unrestricted subtree detection. In: Perron, L., Trick, M.A. (eds.) Proceedings of CPAIOR, pp. 278–282. Springer, New York (2008)
no DOI — not checkedBehle, M.: Binary decision diagrams and integer programming. In: Ph.D. Thesis, Universitat des Saarlandes (2007)
no DOI — not checkedDanna, E., Fenelon, M., Gu, Z., Wunderling, R.: Generating multiple solutions for mixed integer programming problems. In: Fischetti, M., Williamson, D.P. (eds.) Proceedings of IPCO, pp. 280–294. Springer, New York (2007)
no DOI — not checkedGamrath, G., Hiller, B., Witzig, J.: Reoptimization techniques for MIP solvers. In: Bampis, E. (ed.) Proceedings of SEA, pp. 181–192. Springer, New York (2015)
no DOI — not checkedGAMS Support Wiki: Getting a List of Best Integer Solutions of My MIP (2013). https://support.gams.com . Accessed 4 Apr 2019
no DOI — not checkedHadžić, T., Hooker, J.N.: Discrete global optimization with binary decision diagrams. In: Workshop on Global Optimization: Integrating Convexity, Optimization, Logic Programming, and Computational Algebraic Geometry (GICOLAG). Vienna (2006)
no DOI — not checkedHadžić, T., Hooker, J.N.: Technical Report. Postoptimality analysis for integer programming using binary decision diagrams. Carnegie Mellon University, Pittsburgh (2006)
no DOI — not checkedHadžić, T., Hooker, J.N.: Cost-bounded binary decision diagrams for 0–1 programming. In: van Hentemryck, P., Wolsey, L. (eds.) CPAIOR Proceedings. Lecture Notes in Computer Science, vol. 4510, pp. 332–345. Springer, New York (2007)
no DOI — not checkedHaus, U.U., Michini, C.: Representations of all solutions of Boolean programming problems. In: ISAIM (2014)
no DOI — not checkedHu, A.J.: Techniques for efficient formal verification using binary decision diagrams. In: Thesis CS-TR-95-1561, Stanford University, Department of Computer Science, Stanford (1996)
no DOI — not checkedIBM Support: Using CPLEX to Examine Alternate Optimal Solutions (2010). http://www-01.ibm.com/support/docview.wss?uid=swg21399929 . Accessed 4 Apr 2019
What this badge says. CiteStamped means the CHECKABLE references of this work were clean at the dated check: each resolved to a known work in a public registry, and none carried a retraction notice at that time. It says nothing about the quality, findings, or importance of the work itself, and nothing about references deposited without a DOI.

checked 2026-08-09 — re-checked daily as this page is visited; titles and statuses come from Crossref and DataCite and are not part of the signed record

view as graph · paper page

Embed this badge

Both snippets point at the live badge image and link back to this page. The badge re-renders from the daily check, so an embed never goes stale by more than a day of visits.

<a href="https://citestamp.com/citestamped/10.1007/s10107-019-01390-3"><img src="https://citestamp.com/citestamped/10.1007/s10107-019-01390-3/badge.svg" alt="CiteStamped reference-health badge" width="460" height="64"></a>
[![CiteStamped reference-health badge](https://citestamp.com/citestamped/10.1007/s10107-019-01390-3/badge.svg)](https://citestamp.com/citestamped/10.1007/s10107-019-01390-3)