New algorithms for quadratic unconstrained binary optimization (qubo) with applications in engineering and social sciences
暂无分享,去创建一个
[1] L. S. Shapley,et al. 17. A Value for n-Person Games , 1953 .
[2] F. Harary,et al. STRUCTURAL BALANCE: A GENERALIZATION OF HEIDER'S THEORY1 , 1977 .
[3] R. Fortet. L’algebre de Boole et ses applications en recherche operationnelle , 1960 .
[4] H. Weingartner. Capital Budgeting of Interrelated Projects: Survey and Synthesis , 1966 .
[5] F. Hillier. The evaluation of risky interrelated investments , 1966 .
[6] N. S. Barnett,et al. Private communication , 1969 .
[7] S. Vajda,et al. BOOLEAN METHODS IN OPERATIONS RESEARCH AND RELATED AREAS , 1969 .
[8] D. J. Laughhunn. Quadratic Binary Programming with Application to Capital-Budgeting Problems , 1970, Oper. Res..
[9] Peter L. Hammer,et al. Some remarks on quadratic programming with 0-1 variables , 1970 .
[10] J. Rhys. A Selection Problem of Shared Fixed Costs and Network Flows , 1970 .
[11] P. Hammer,et al. Applications of pseudo-Boolean methods to economic problems , 1971 .
[12] M. Rao. Cluster Analysis and Mathematical Programming , 1971 .
[13] Robert E. Tarjan,et al. Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..
[14] Fred W. Glover,et al. Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems , 1973, Oper. Res..
[15] P. Hammer,et al. Linear Decomposition of a Positive Group-Boolean Function , 1974 .
[16] Abraham Warszawski. Pseudo-Boolean Solutions to Multidimensional Location Problems , 1974, Oper. Res..
[17] László Lovász,et al. On the ratio of optimal integral and fractional covers , 1975, Discret. Math..
[18] Leslie E. Trotter,et al. Vertex packings: Structural properties and algorithms , 1975, Math. Program..
[19] H. D. Ratliff,et al. Minimum cuts and related problems , 1975, Networks.
[20] David S. Johnson,et al. Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..
[21] R. Ranyard. AN ALGORITHM FOR MAXIMUM LIKELIHOOD RANKING AND SLATER'S i FROM PAIRED COMPARISONS , 1976 .
[22] Peter L. Hammer. Pseudo-Boolean remarks on balanced graphs , 1977 .
[23] Neil J. A. Sloane,et al. The theory of error-correcting codes (north-holland , 1977 .
[24] Spiros G. Papaioannou. Optimal Test Generation in Combinational Networks by Pseudo-Boolean Programming , 1977, IEEE Transactions on Computers.
[25] J. C. Picard,et al. On the integer-valued variables in the linear vertex packing problem , 1977, Math. Program..
[26] H. D. Ratliff,et al. A Cut Approach to the Rectilinear Distance Facility Location Problem , 1978, Oper. Res..
[27] Robert E. Tarjan,et al. A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas , 1979, Inf. Process. Lett..
[28] R. McBride,et al. An Implicit Enumeration Algorithm for Quadratic Integer Programming , 1980 .
[29] P. Hammer,et al. Quadratic knapsack problems , 1980 .
[30] Eitan Zemel. Measuring the Quality of Approximate Solutions to Zero-One Programming Problems , 1981, Math. Oper. Res..
[31] P. Hammer,et al. UPPER PLANES OF QUADRATIC 0–1 FUNCTIONS AND STABILITY IN GRAPHS , 1981 .
[32] Yoji Kajitani,et al. A graph- theoretic via minimization algorithm for two layer printed circuit boards , 1983 .
[33] Michael W. Carter,et al. The indefinite zero-one quadratic problem , 1984, Discret. Appl. Math..
[34] R. Pinter. Optimal layer assignment for interconnect , 1984 .
[35] Egon Balas,et al. Nonlinear 0–1 programming: II. Dominance relations and algorithms , 1983, Math. Program..
[36] P. Hammer,et al. Pseudo-Boolean functions and stability of graphs , 1984 .
[37] P. Hammer,et al. Pseudo-Boolean Functions and Their Graphs , 1984 .
[38] A. K. Mittal,et al. Unconstrained quadratic bivalent programming problem , 1984 .
[39] Pierre Hansen,et al. Roof duality, complementation and persistency in quadratic 0–1 optimization , 1984, Math. Program..
[40] Pierre Hansen,et al. Uniquely solvable quadratic boolean equations , 1985, Discret. Appl. Math..
[41] Peter L. Hammer,et al. The struction of a graph: Application toCN-free graphs , 1985, Comb..
[42] Martin Grötschel,et al. An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design , 1988, Oper. Res..
[43] A. Billionnet,et al. A decomposition method for minimizing quadratic pseudo-Boolean functions , 1989 .
[44] Sumio Masuda,et al. The Via Minimization Problem is NP-Complete , 1989, IEEE Trans. Computers.
[45] P. Hammer,et al. Quadratic functions of binary variables , 1989 .
[46] Martin Grötschel,et al. Via Minimization with Pin Preassignments and Layer Preference , 1989 .
[47] A. Prékopa,et al. Probabilistic bounds and algorithms for the maximum satisfiability problem , 1990 .
[48] Michael Jünger,et al. Experiments in quadratic 0–1 programming , 1989, Math. Program..
[49] Andrzej Pelc,et al. Distributed probabilistic fault diagnosis for multiprocessor systems , 1990, [1990] Digest of Papers. Fault-Tolerant Computing: 20th International Symposium.
[50] Bahman Kalantari,et al. An algorithm for quadratic zero-one programs , 1990 .
[51] K. Corrádi,et al. A combinatorial approach for Keller's conjecture , 1990 .
[52] Y. Crama,et al. Upper-bounds for quadratic 0-1 maximization , 1990 .
[53] John E. Beasley,et al. OR-Library: Distributing Test Problems by Electronic Mail , 1990 .
[54] P. Pardalos,et al. An exact algorithm for the maximum clique problem , 1990 .
[55] Panos M. Pardalos,et al. Construction of test problems in quadratic bivalent programming , 1991, TOMS.
[56] Cecilia R. Aragon,et al. Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning , 1991, Oper. Res..
[57] Panos M. Pardalos,et al. An algorithm for finding a maximum weighted independent set in an arbitrary graph , 1991, Int. J. Comput. Math..
[58] Endre Boros,et al. The max-cut problem and quadratic 0–1 optimization; polyhedral aspects, relaxations and bounds , 1991, Ann. Oper. Res..
[59] Peter L. Hammer,et al. On a Transformation which Preserves the Stability Number , 1991 .
[60] Chung-Kuan Cheng,et al. The Orientation of Modules Based on Graph Decomposition , 1991, IEEE Trans. Computers.
[61] Jeffrey C. Lagarias,et al. Keller’s cube-tiling conjecture is false in high dimensions , 1992 .
[62] Peter L. Hammer,et al. Approximations of pseudo-Boolean functions; applications to game theory , 1992, ZOR Methods Model. Oper. Res..
[63] Panos M. Pardalos,et al. Complexity of uniqueness and local search in quadratic 0-1 programming , 1992, Oper. Res. Lett..
[64] Peter L. Hammer,et al. Boolean-Combinatorial Bounding of Maximum 2-Satisfiability , 1992, Computer Science and Operations Research.
[65] Panos M. Pardalos,et al. A branch and bound algorithm for the maximum clique problem , 1992, Comput. Oper. Res..
[66] Xiaorong Sun. Combinatorial algorithms for Boolean and pseudo-Boolean functions , 1992 .
[67] Laura A. Sanchis,et al. Test Case Construction for the Vertex Cover Problem , 1992, Computational Support for Discrete Mathematics.
[68] Endre Boros,et al. Chvátal Cuts and ODD Cycle Inequalities in Quadratic 0 - 1 Optimization , 1992, SIAM J. Discret. Math..
[69] Panos M. Pardalos,et al. Test case generators and computational results for the maximum clique problem , 1993, J. Glob. Optim..
[70] Joseph C. Culberson,et al. Camouflaging independent sets in quasi-random graphs , 1993, Cliques, Coloring, and Satisfiability.
[71] Michel Gendreau,et al. Solving the maximum clique problem using a tabu search approach , 1993, Ann. Oper. Res..
[72] Endre Boros,et al. Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions , 1993, Math. Oper. Res..
[73] G. Kochenberger,et al. 0-1 Quadratic programming approach for optimum solutions of two scheduling problems , 1994 .
[74] J. Ben Rosen,et al. A quadratic assignment formulation of the molecular conformation problem , 1994, J. Glob. Optim..
[75] Michael Jünger,et al. Quadratic 0/1 optimization and a decomposition approach for the placement of electronic circuits , 1994, Math. Program..
[76] Warren P. Adams,et al. On the Equivalence Between Roof Duality and Lagrangian Duality for Unconstrained 0-1 Quadratic Programming Problems , 1994, Discret. Appl. Math..
[77] G. Rinaldi,et al. Exact ground states of Ising spin glasses: New experimental results with a branch-and-cut algorithm , 1995 .
[78] Endre Boros,et al. Recognition of q-Horn Formulae in Linear Time , 1994, Discret. Appl. Math..
[79] Alain Billionnet,et al. Minimization of a quadratic pseudo-Boolean function , 1994 .
[80] M. R. Rao,et al. Facets of the K-partition Polytope , 1995, Discret. Appl. Math..
[81] P. Chardaire,et al. A Decomposition Method for Quadratic Zero-One Programming , 1995 .
[82] Øivind Due Trier,et al. Evaluation of Binarization Methods for Document Images , 1995, IEEE Trans. Pattern Anal. Mach. Intell..
[83] Wieslaw Kubiak,et al. New Results on the Completion Time Variance Minimization , 1995, Discret. Appl. Math..
[84] David P. Williamson,et al. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.
[85] Yves Crama,et al. Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems , 1995, Ann. Oper. Res..
[86] Alain Hertz,et al. Polynomially Solvable Cases for the Maximum Stable Set Problem , 1991, Discret. Appl. Math..
[87] Laura A. Sanchis,et al. Some Experimental and Theoretical Results on Test Case Generators for the Maximum Clique Problem , 1996, INFORMS J. Comput..
[88] David S. Johnson,et al. Cliques, Coloring, and Satisfiability , 1996 .
[89] Oliver Kullman. Worst-case analysis, 3-SAT decision and lower bounds: Approaches for improved SAT algorithms , 1996, Satisfiability Problem: Theory and Applications.
[90] Alain Hertz,et al. On the Use of Boolean Methods for the Computation of the Stability Number , 1997, Discret. Appl. Math..
[91] Marcus Peinado,et al. Design and Performance of Parallel and Distributed Approximation Algorithms for Maxcut , 1997, J. Parallel Distributed Comput..
[92] Kurt Mehlhorn,et al. The LEDA Platform of Combinatorial and Geometric Computing , 1997, ICALP.
[93] John E. Beasley,et al. Heuristic algorithms for the unconstrained binary quadratic programming problem , 1998 .
[94] Brian Borchers,et al. A Two-Phase Exact Algorithm for MAX-SAT and Weighted MAX-SAT Problems , 1998, J. Comb. Optim..
[95] F. Glover,et al. Adaptive Memory Tabu Search for Binary Quadratic Programs , 1998 .
[96] C. Helmberg,et al. Solving quadratic (0,1)-problems by semidefinite programs and cutting planes , 1998 .
[97] Endre Boros,et al. Minimization of Half-Products , 1998, Math. Oper. Res..
[98] David R. Karger,et al. Finding maximum flows in undirected graphs seems easier than bipartite matching , 1998, STOC '98.
[99] Endre Boros,et al. Optimal Cell Flipping to Minimize Channel Density in VLSI Design and Pseudo-Boolean Optimization , 1999, Discret. Appl. Math..
[100] P. Pardalos,et al. The Maximum Clique Problem , 1999, Handbook of Combinatorial Optimization.
[101] B. Freisleben,et al. Genetic algorithms for binary quadratic programming , 1999 .
[102] F. Glover,et al. Tabu Search with Critical Event Memory: An Enhanced Application for Binary Quadratic Programs , 1999 .
[103] Martin W. P. Savelsbergh,et al. Conflict graphs in solving integer programming problems , 2000, Eur. J. Oper. Res..
[104] Masakazu Kojima,et al. Numerical Evaluation of SDPA (Semidefinite Programming Algorithm) , 2000 .
[105] Xiong Zhang,et al. Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization , 1999, SIAM J. Optim..
[106] Franz Rendl,et al. A Spectral Bundle Method for Semidefinite Programming , 1999, SIAM J. Optim..
[107] Hong Yan,et al. An adaptive logical method for binarization of degraded document images , 2000, Pattern Recognit..
[108] Rolf Niedermeier,et al. Faster Exact Solutions for MAX2SAT , 2000, CIAC.
[109] Éric Soutif,et al. Decomposition and Linearization for 0-1 Quadratic Programming , 2000, Ann. Oper. Res..
[110] B. Jaumard,et al. A Simple Enumerative Algorithm for Unconstrained 0-1 Quadratic Programming , 2000 .
[111] Kengo Katayama,et al. Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem , 2001, Eur. J. Oper. Res..
[112] Yong-Hyuk Kim,et al. A hybrid genetic algorithm for the MAX CUT problem , 2001 .
[113] Kihong Park,et al. On the effectiveness of route-based packet filtering for distributed DoS attack prevention in power-law internets , 2001, SIGCOMM '01.
[114] Olga Veksler,et al. Fast Approximate Energy Minimization via Graph Cuts , 2001, IEEE Trans. Pattern Anal. Mach. Intell..
[115] Ching Y. Suen,et al. Stroke-model-based character extraction from gray-level document images , 2001, IEEE Trans. Image Process..
[116] Bernd Freisleben,et al. Greedy and Local Search Heuristics for Unconstrained Binary Quadratic Programming , 2002, J. Heuristics.
[117] Panos M. Pardalos,et al. Randomized heuristics for the Max-Cut problem , 2002, Optim. Methods Softw..
[118] Yin Zhang,et al. Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs , 2002, SIAM J. Optim..
[119] Endre Boros,et al. Pseudo-Boolean optimization , 2002, Discret. Appl. Math..
[120] Christoph Helmberg,et al. A spectral bundle method with bounds , 2002, Math. Program..
[121] Fred W. Glover,et al. One-pass heuristics for large-scale unconstrained binary quadratic problems , 2002, Eur. J. Oper. Res..
[122] Yin Zhang,et al. Maximum stable set formulations and heuristics based on continuous optimization , 2002, Math. Program..
[123] Hantao Zhang,et al. An Empirical Study of MAX-2-SAT Phase Transitions , 2003, Electron. Notes Discret. Math..
[124] Renato D. C. Monteiro,et al. A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization , 2003, Math. Program..
[125] A. P. Young,et al. Monte Carlo studies of the one-dimensional Ising spin glass with power-law interactions , 2003 .
[126] Jordi Planes. Improved Branch and Bound Algorithms for Max-2-SAT and Weighted Max-2-SAT , 2003, CP.
[127] Felip Manyà,et al. Exact Algorithms for MAX-SAT , 2003, FTP.
[128] Peter L. Hammer,et al. Struction revisited , 2003, Discret. Appl. Math..
[129] Christoph Helmberg,et al. Numerical evaluation of SBmethod , 2003, Math. Program..
[130] Robert E. Tarjan,et al. Graph Clustering and Minimum Cut Trees , 2004, Internet Math..
[131] Wei Li,et al. Many hard examples in exact phase transitions , 2003, Theor. Comput. Sci..
[132] Teresa Alsinet,et al. Improved branch and bound algorithms for Max-SAT , 2003 .
[133] Frauke Liers. Contributions to Determining Exact Ground-States of Ising Spin-Glasses and to their Physics , 2004 .
[134] Endre Boros,et al. Block linear majorants in quadratic 0-1 optimization , 2004, Discret. Appl. Math..
[135] Michael R. Fellows,et al. Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments , 2004, ALENEX/ANALC.
[136] Gintaras Palubeckis,et al. APPLICATION OF MULTISTART TABU SEARCH TO THE MAX-CUT PROBLEM , 2004 .
[137] Vladimir Kolmogorov,et al. An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision , 2004, IEEE Trans. Pattern Anal. Mach. Intell..
[138] R. Zabih,et al. What energy functions can be minimized via graph cuts , 2004 .
[139] Bahram Alidaee,et al. Evaluating a Clique Partitioning Problem Model for Clustering High-Dimensional Data Mining , 2004, AMCIS.
[140] Daniel Axehill,et al. A preprocessing algorithm for MIQP solvers with applications to MPC , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).
[141] Thomas Schiex,et al. Solving weighted CSP by maintaining arc consistency , 2004, Artif. Intell..
[142] Miroslav Chlebík,et al. Crown reductions for the Minimum Weighted Vertex Cover problem , 2008, Discret. Appl. Math..
[143] Gintaras Palubeckis,et al. Multistart Tabu Search Strategies for the Unconstrained Binary Quadratic Optimization Problem , 2004, Ann. Oper. Res..
[144] Philippe Michelon,et al. “Miniaturized” Linearizations for Quadratic 0/1 Problems , 2005, Ann. Oper. Res..
[145] Gintaras Palubeckis. A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming , 2005, Computing.
[146] Hantao Zhang,et al. Improving exact algorithms for MAX-2-SAT , 2005, Annals of Mathematics and Artificial Intelligence.
[147] Rolf Niedermeier,et al. Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs , 2005, Discret. Appl. Math..
[148] Endre Boros,et al. Polynomial-time inference of all valid implications for Horn and related formulae , 1990, Annals of Mathematics and Artificial Intelligence.
[149] Priya Mahadevan,et al. Lessons from Three Views of the Internet Topology , 2005, ArXiv.
[150] Simon de Givry,et al. Existential arc consistency: Getting closer to full arc consistency in weighted CSPs , 2005, IJCAI.
[151] Weixiong Zhang,et al. MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability , 2005, Artif. Intell..
[152] Sergiy Butenko,et al. Novel Approaches for Analyzing Biological Networks , 2005, J. Comb. Optim..
[153] Panos M. Pardalos,et al. Computational aspects of a branch and bound algorithm for quadratic zero-one programming , 1990, Computing.
[154] Michel Minoux,et al. Exact MAX-2SAT solution via lift-and-project closure , 2006, Oper. Res. Lett..
[155] Franz Rendl,et al. Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and Equipartition , 2006, Math. Program..
[156] Francisco Barahona,et al. Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut , 2006, RAIRO Oper. Res..
[157] Songcan Chen,et al. Image binarization focusing on objects , 2006, Neurocomputing.
[158] Panos M. Pardalos,et al. Lower Bound Improvement and Forcing Rule for Quadratic Binary Programming , 2006, Comput. Optim. Appl..
[159] Gurmeet Singh,et al. MRF's forMRI's: Bayesian Reconstruction of MR Images via Graph Cuts , 2006, CVPR.
[160] G. Rinaldi,et al. Compact Integer Programming Formulations for Boolean Optimization Problems , 2007 .
[161] Robert Ashford,et al. Mixed integer programming: A historical perspective with Xpress-MP , 2007, Ann. Oper. Res..
[162] Endre Boros,et al. Local search heuristics for Quadratic Unconstrained Binary Optimization (QUBO) , 2007, J. Heuristics.
[163] Hiroshi Nagamochi,et al. EFFICIENT BRANCH-AND-BOUND ALGORITHMS FOR WEIGHTED MAX-2-SAT , 2007 .
[164] J. Jeffry Howbert,et al. The Maximum Clique Problem , 2007 .
[165] Franz Rendl,et al. A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations , 2007, IPCO.
[166] Tian Zheng,et al. Optimum cut-based clustering , 2007, Signal Process..
[167] Felip Manyà,et al. New Inference Rules for Max-SAT , 2007, J. Artif. Intell. Res..
[168] Sergiy Butenko,et al. Using critical sets to solve the maximum independent set problem , 2007, Oper. Res. Lett..
[169] Alain Billionnet,et al. Using a Mixed Integer Quadratic Programming Solver for the Unconstrained Quadratic 0-1 Problem , 2007, Math. Program..
[170] Vladimir Kolmogorov,et al. Optimizing Binary MRFs via Extended Roof Duality , 2007, 2007 IEEE Conference on Computer Vision and Pattern Recognition.
[171] Endre Boros,et al. A max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO) , 2008, Discret. Optim..
[172] Richard Laundy,et al. Solving Hard Mixed-Integer Programming Problems with Xpress-MP: A MIPLIB 2003 Case Study , 2009, INFORMS J. Comput..
[173] Michel Balinski,et al. Integer Programming: Methods, Uses, Computation , 2010, 50 Years of Integer Programming.
[174] Siam J. CoMPtrr,et al. FINDING A MAXIMUM CUT OF A PLANAR GRAPH IN POLYNOMIAL TIME * , 2022 .
[175] Giilta. HEURISTICS WITH A WORST-CASE BOUND FOR UNCONSTRAINED QUADRATIC 0-1 PROGRAMMING , .