Low order polynomial bounds on the expected performance of local improvement algorithms
Mathematical Programming: Series A and B
Strong unimodularity for matrices and hypergraphs
Discrete Applied Mathematics
Discrete Applied Mathematics
Discrete Mathematics
A solvable case of quadratic 0-1 programming
Discrete Applied Mathematics
Future paths for integer programming and links to artificial intelligence
Computers and Operations Research - Special issue: Applications of integer programming
Mathematical Programming: Series A and B
Multiple optima in local search
Journal of Algorithms
Roof duality for polynomial 0-1 optimization
Mathematical Programming: Series A and B
Randomized rounding: a technique for provably good algorithms and algorithmic proofs
Combinatorica - Theory of Computing
Probabilistic construction of deterministic algorithms: approximating packing integer programs
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
From linear separability to unimodality: a hierarchy of pseudo-Boolean functions
SIAM Journal on Discrete Mathematics
On the supermodular knapsack problem
Mathematical Programming: Series A and B
The Boolean quadric polytope: some characteristics, facets and relatives
Mathematical Programming: Series A and B
Average performance of heuristics for satisfiability
SIAM Journal on Discrete Mathematics
Modeling brain function—the world of attractor neural networks
Modeling brain function—the world of attractor neural networks
Recognition problems for special classes of polynomials in 0-1 variables
Mathematical Programming: Series A and B
The cut polytope and the Boolean quadric polytope
Discrete Mathematics
Probabilistic bounds and algorithms for the maximum satisfiability problem
Annals of Operations Research
Quadratic functions of binary variables
COMO '86 Lectures given at the third session of the Centro Internazionale Matematico Estivo (C.I.M.E.) on Combinatorial optimization
A bound on the roof-duality gap
COMO '86 Lectures given at the third session of the Centro Internazionale Matematico Estivo (C.I.M.E.) on Combinatorial optimization
Recognition of quadratic graphs and adjoints of bidirected graphs
Proceedings of the third international conference on Combinatorial mathematics
Unconstrained 0–1 optimization and Lagrangian relaxation
Selected papers on First international colloquium on pseudo-boolean optimization and related topics
The basic algorithm for pseudo-Boolean programming revisited
Selected papers on First international colloquium on pseudo-boolean optimization and related topics
On the equivalence of paved-duality and standard linearization of nonlinear 0–1 optimization
Selected papers on First international colloquium on pseudo-boolean optimization and related topics
Chva´tal cuts and odd cycle inequalities in quadratic 0–1 optimization
SIAM Journal on Discrete Mathematics
Persistency in quadratic 0–1 optimization
Mathematical Programming: Series A and B
Cut-polytopes, Boolean quadratic polytopes and nonnegative quadratic pseudo-Boolean functions
Mathematics of Operations Research
Concave extensions for nonlinear 0–1 maximization problems
Mathematical Programming: Series A and B
Mathematical Programming: Series A and B
Facets for the cut cone II: clique-web inequalities
Mathematical Programming: Series A and B
Discrete Applied Mathematics
The struction algorithm for the maximum stable set problem revisited
Discrete Mathematics
On the approximation of maximum satisfiability
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
New ${\bf \frac{3}{4}}$-Approximation Algorithms for the Maximum Satisfiability Problem
SIAM Journal on Discrete Mathematics
New results on the completion time variance minimization
Proceedings of the workshop on Discrete algorithms
Polynomially solvable cases for the maximum stable set problem
Discrete Applied Mathematics - Special volume: Aridam VI and VII, Rutcor, New Brunswick, NJ, USA (1991 and 1992)
Interactive proofs and the hardness of approximating cliques
Journal of the ACM (JACM)
Algorithms for minclique scheduling problems
Discrete Applied Mathematics - Special issue on models and algorithms for planning and scheduling problems
Some optimal inapproximability results
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On the use of Boolean methods for the computation of the stability number
GO-II Meeting Proceedings of the second international colloquium on Graphs and optimization
Mathematics of Operations Research
Optimal cell flipping to minimize channel density in VLSI design and pseudo-Boolean optimization
Discrete Applied Mathematics - Special volume on VLSI
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
On the Maximization of a Pseudo-Boolean Function
Journal of the ACM (JACM)
Complexity of Partial Satisfaction
Journal of the ACM (JACM)
Maximum renamable Horn sub-CNFs
Discrete Applied Mathematics - Special issue on the satisfiability problem and Boolean functions
A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A combinatorial algorithm minimizing submodular functions in strongly polynomial time
Journal of Combinatorial Theory Series B
Covering non-uniform hypergraphs
Journal of Combinatorial Theory Series B
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Free bits, PCPs and non-approximability-towards tight results
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
A 7/8-Approximation Algorithm for MAX 3SAT?
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Gadgets Approximation, and Linear Programming
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
Minimization of ordered, symmetric half-products
Discrete Applied Mathematics
Best approximations of fitness functions of binary strings
Natural Computing: an international journal
Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)
Exact and heuristic approaches to input vector control for leakage power reduction
Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design
Subset-conjunctive rules for breast cancer diagnosis
Discrete Applied Mathematics - Special issue: Discrete mathematics & data mining II (DM & DM II)
The complexity of soft constraint satisfaction
Artificial Intelligence
A Linear Programming Approach to Max-Sum Problem: A Review
IEEE Transactions on Pattern Analysis and Machine Intelligence
Minimizing Nonsubmodular Functions with Graph Cuts-A Review
IEEE Transactions on Pattern Analysis and Machine Intelligence
Dynamic Graph Cuts for Efficient Inference in Markov Random Fields
IEEE Transactions on Pattern Analysis and Machine Intelligence
Training structural SVMs when exact inference is intractable
Proceedings of the 25th international conference on Machine learning
On partial optimality in multi-label MRFs
Proceedings of the 25th international conference on Machine learning
A network approach for specially structured linear programs arising in 0-1 quadratic optimization
Discrete Applied Mathematics
Measuring uncertainty in graph cut solutions
Computer Vision and Image Understanding
A Pseudo-Boolean Optimization for Multiple Criteria Decision Making in Complex Systems
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007
Classes of Submodular Constraints Expressible by Graph Cuts
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
A Framework for Hybrid Tractability Results in Boolean Weighted Constraint Satisfaction Problems
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
A global continuation algorithm for solving binary quadratic programming problems
Computational Optimization and Applications
The expressive power of valued constraints: Hierarchies and collapses
Theoretical Computer Science
Minor-embedding in adiabatic quantum computation: I. The parameter setting problem
Quantum Information Processing
Graphical Models, Exponential Families, and Variational Inference
Foundations and Trends® in Machine Learning
A linearization framework for unconstrained quadratic (0-1) problems
Discrete Applied Mathematics
Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
Discrete Applied Mathematics
Robust Higher Order Potentials for Enforcing Label Consistency
International Journal of Computer Vision
Polyhedral outer approximations with application to natural language parsing
ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
On Total Variation Minimization and Surface Evolution Using Parametric Maximum Flows
International Journal of Computer Vision
Note: The expressive power of binary submodular functions
Discrete Applied Mathematics
Max-Margin Weight Learning for Markov Logic Networks
ECML PKDD '09 Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part I
Virtual Arc consistency for weighted CSP
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
New inference rules for Max-SAT
Journal of Artificial Intelligence Research
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
The complexity of soft constraint satisfaction
Artificial Intelligence
Graph cuts with many-pixel interactions: Theory and applications to shape modelling
Image and Vision Computing
A microarchitecture-based framework for pre- and post-silicon power delivery analysis
Proceedings of the 42nd Annual IEEE/ACM International Symposium on Microarchitecture
Concise integer linear programming formulations for dependency parsing
ACL '09 Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 1 - Volume 1
Subset-conjunctive rules for breast cancer diagnosis
Discrete Applied Mathematics - Special issue: Discrete mathematics & data mining II (DM & DM II)
Global optimality conditions for quadratic 0-1 optimization problems
Journal of Global Optimization
Simple negotiation schemes for agents with simple preferences: sufficiency, necessity and maximality
Autonomous Agents and Multi-Agent Systems
Soft arc consistency revisited
Artificial Intelligence
FPGA implementation of an adaptive stochastic neural model
ICANN'07 Proceedings of the 17th international conference on Artificial neural networks
The complexity of valued constraint models
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
MAP estimation of semi-metric MRFs via hierarchical graph cuts
UAI '09 Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence
Temperature- and energy-constrained scheduling in multitasking systems: a model checking approach
Proceedings of the 16th ACM/IEEE international symposium on Low power electronics and design
Note: Facet-inducing web and antiweb inequalities for the graph coloring polytope
Discrete Applied Mathematics
Globally optimal multi-target tracking on a hexagonal lattice
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part I
Cosegmentation revisited: models and optimization
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part II
Minimization of monotonically levelable higher order MRF energies via graph cuts
IEEE Transactions on Image Processing
Object Detection and Tracking for Autonomous Navigation in Dynamic Environments
International Journal of Robotics Research
A Framework for Certified Boolean Branch-and-Bound Optimization
Journal of Automated Reasoning
Fast multi-labelling for stereo matching
ECCV'10 Proceedings of the 11th European conference on computer vision conference on Computer vision: Part III
Collective Inference for Extraction MRFs Coupled with Symmetric Clique Potentials
The Journal of Machine Learning Research
Towards the geometry of estimation of distribution algorithms based on the exponential family
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms
Data aggregation for p-median problems
Journal of Combinatorial Optimization
Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
Quantum Information Processing
Minimizing count-based high order terms in markov random fields
EMMCVPR'11 Proceedings of the 8th international conference on Energy minimization methods in computer vision and pattern recognition
Optimization by Stochastic Continuation
SIAM Journal on Imaging Sciences
Second-Order Cone Relaxations for Binary Quadratic Polynomial Programs
SIAM Journal on Optimization
Generalized roof duality and bisubmodular functions
Discrete Applied Mathematics
Fast Approximate Energy Minimization with Label Costs
International Journal of Computer Vision
A discrete adaptive stochastic neural model for constrained optimization
ICANN'06 Proceedings of the 16th international conference on Artificial Neural Networks - Volume Part I
Efficient learning of pseudo-boolean functions from limited training data
ISMIS'05 Proceedings of the 15th international conference on Foundations of Intelligent Systems
Systems of linear equations over F2 and problems parameterized above average
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
An exact solution method for unconstrained quadratic 0---1 programming: a geometric approach
Journal of Global Optimization
New algorithms for convex cost tension problem with application to computer vision
Discrete Optimization
Using xQx to model and solve the uncapacitated task allocation problem
Operations Research Letters
On complexity of unconstrained hyperbolic 0-1 programming problems
Operations Research Letters
Minimizing Energies with Hierarchical Costs
International Journal of Computer Vision
Communication: Hypercontractive inequality for pseudo-Boolean functions of bounded Fourier width
Discrete Applied Mathematics
Discrete Applied Mathematics
Tractable triangles and cross-free convexity in discrete optimisation
Journal of Artificial Intelligence Research
Fast fusion moves for multi-model estimation
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part I
Approximate MRF inference using bounded treewidth subgraphs
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part I
Hausdorff distance constraint for multi-surface segmentation
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part I
On learning higher-order consistency potentials for multi-class pixel labeling
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part II
Analyzing the subspace structure of related images: concurrent segmentation of image sets
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part IV
Image labeling on a network: using social-network metadata for image classification
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part IV
Relating things and stuff by high-order potential modeling
ECCV'12 Proceedings of the 12th international conference on Computer Vision - Volume Part III
Submodular relaxation for MRFs with high-order potentials
ECCV'12 Proceedings of the 12th international conference on Computer Vision - Volume Part III
A new encoding from MinSAT into MaxSAT
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Particle Algorithms for Optimization on Binary Spaces
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special Issue on Monte Carlo Methods in Statistics
Multivariate arrival rate estimation using semidefinite programming
Proceedings of the Winter Simulation Conference
Critical infrastructure management for telecommunication networks
AMT'12 Proceedings of the 8th international conference on Active Media Technology
Second order partial derivatives for NK-landscapes
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Hyperplane initialized local search for MAXSAT
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Contextually guided semantic labeling and search for three-dimensional point clouds
International Journal of Robotics Research
Modularity-based decompositions for valued CSP
Annals of Mathematics and Artificial Intelligence
On characterization of maximal independent sets via quadratic optimization
Journal of Heuristics
Computer Vision and Image Understanding
The expressibility of functions on the boolean domain, with applications to counting CSPs
Journal of the ACM (JACM)
Discovering social circles in ego networks
ACM Transactions on Knowledge Discovery from Data (TKDD) - Casin special issue
Adiabatic quantum programming: minor embedding with hard faults
Quantum Information Processing
Satisfying more than half of a system of linear equations over GF(2): A multivariate approach
Journal of Computer and System Sciences
| Hi-index | 0.05 |
This survey examines the state of the art of a variety of problems related to pseudo-Boolean optimization, i.e. to the optimization of set functions represented by closed algebraic expressions. The main parts of the survey examine general pseudo-Boolean optimization, the specially important case of quadratic pseudo-Boolean optimization (to which every pseudo-Boolean optimization can be reduced), several other important special classes, and approximation algorithms.