Narrow search
Showing 1 - 10 of 20
Cover Image
A DECOMPOSITION THEOREM FOR BALANCED MATRICES.
CONFORTI, M.; CORNUEJOLS, G. - Carnegie Mellon University, Tepper School of Business - 1990
Persistent link: https://www.econbiz.de/10005027522
Cover Image
THE WEIGHTED UNI-DIMENTIONAL SIMILARITIES PROBLEM WITH LEAST ABSOLUTE VALUE METRIC IS NP-HARD.
RITCHEY, N.P.; THOMPSON, G.L. - Carnegie Mellon University, Tepper School of Business - 1990
Persistent link: https://www.econbiz.de/10005027597
Cover Image
A Computational Stufy of Satisfiability Algorithms for Propositional Logic.
Hooker, J.N.; harche, F.; Thompson, G.L. - Carnegie Mellon University, Tepper School of Business - 1991
Persistent link: https://www.econbiz.de/10005027609
Cover Image
An Algebraic Geometry Algorithm for Scheduling in Presence of Setups and Correlated Demands.
Tayur, S.R.; Thomas, R.R.; Natraj, N.R. - Carnegie Mellon University, Tepper School of Business - 1992
Persistent link: https://www.econbiz.de/10005029123
Cover Image
An Exact Two-Matching Based Branch and Bound Algorithm for the Symmetric Traveling Salesman Problem.
Miller, D.L.; Pekny, J.F.; Thompson, G.L. - Carnegie Mellon University, Tepper School of Business - 1991
Persistent link: https://www.econbiz.de/10005029129
Cover Image
New Methods for Computing Inferences in First Order Logic.
Hooker, N.J. - Carnegie Mellon University, Tepper School of Business - 1991
Persistent link: https://www.econbiz.de/10005070193
Cover Image
Logic-Based Methods for Optimization: A Tutorial.
Hooker, J.N. - Carnegie Mellon University, Tepper School of Business - 1994
Persistent link: https://www.econbiz.de/10005073550
Cover Image
From Totality Unimodular to Bakanced 0 +- Matrices : A Family of Integer Polytopes.
Conforti, M.; Cornuejols, G.; Truemper, K. - Carnegie Mellon University, Tepper School of Business - 1992
Persistent link: https://www.econbiz.de/10005073554
Cover Image
Solving the Incremental Satisfiability Problem.
Hooker, N.J. - Carnegie Mellon University, Tepper School of Business - 1991
Persistent link: https://www.econbiz.de/10005073574
Cover Image
A Class of Logical Inference Problem Solvable by Linear Programming.
Conforti, M.; Cornuejols, G. - Carnegie Mellon University, Tepper School of Business - 1992
Persistent link: https://www.econbiz.de/10005073576