On the public citation graph
The max-cut problem and quadratic 0–1 optimization; polyhedral aspects, relaxations and bounds
0 signed · 138 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/978-1-4613-2003-6openalex-snapshot
Assignment Problems in Parallel and Distributed Computing
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/978-3-0348-5936-3_5openalex-snapshot
Pseudo-Boolean remarks on balanced graphs
inferredcites →https://doi.org/10.1007/bf01580870openalex-snapshot
Facets of the clique partitioning polytope
inferredcites →https://doi.org/10.1007/bf01587084openalex-snapshot
Experiments in quadratic 0–1 programming
inferredcites →https://doi.org/10.1007/bf01589101openalex-snapshot
The boolean quadric polytope: Some characteristics, facets and relatives
inferredcites →https://doi.org/10.1007/bf02579273openalex-snapshot
The ellipsoid method and its consequences in combinatorial optimization
inferredcites →https://doi.org/10.1007/bf02591742openalex-snapshot
Roof duality for polynomial 0–1 optimization
inferredcites →https://doi.org/10.1007/bf02591796openalex-snapshot
Nonlinear 0–1 programming: I. Linearization techniques
inferredcites →https://doi.org/10.1007/bf02591797openalex-snapshot
Nonlinear 0–1 programming: II. Dominance relations and algorithms
inferredcites →https://doi.org/10.1007/bf02612354openalex-snapshot
Roof duality, complementation and persistency in quadratic 0–1 optimization
inferredcites →https://doi.org/10.1016/0012-365x(89)90080-0openalex-snapshot
On clustering problems with connected optima in euclidean spaces
inferredcites →https://doi.org/10.1016/0012-365x(90)90056-nopenalex-snapshot
The cut polytope and the Boolean quadric polytope
inferredcites →https://doi.org/10.1016/0024-3795(89)90476-xopenalex-snapshot
On cutting-plane proofs in combinatorial optimization
inferredcites →https://doi.org/10.1016/0166-218x(86)90065-xopenalex-snapshot
A solvable case of quadratic 0–1 programming
inferredcites →https://doi.org/10.1016/0166-218x(90)90142-yopenalex-snapshot
The basic algorithm for pseudo-Boolean programming revisited
inferredcites →https://doi.org/10.1016/0166-218x(90)90143-zopenalex-snapshot
On the equivalence of paved-duality and standard linearization in nonlinear 0–1 optimization
inferredcites →https://doi.org/10.1016/0167-6377(81)90020-1openalex-snapshot
Weakly bipartite graphs and the Max-cut problem
inferredcites →https://doi.org/10.1016/0167-6377(83)90016-0openalex-snapshot
The max-cut problem on graphs not contractible to K5
inferredcites →https://doi.org/10.1016/0167-6377(89)90043-6openalex-snapshot
A decomposition method for minimizing quadratic pseudo-Boolean functions
inferredcites →https://doi.org/10.1016/0167-6377(90)90044-6openalex-snapshot
Upper-bounds for quadratic 0–1 maximization
inferredcites →https://doi.org/10.1016/s0146-664x(76)80003-2openalex-snapshot
A survey of techniques for the display of continuous tone pictures on bilevel displays
inferredcites →https://doi.org/10.1016/s0167-5060(08)70343-1openalex-snapshot
Methods of Nonlinear 0-1 Programming
inferredcites →https://doi.org/10.1016/s0195-6698(13)80049-2openalex-snapshot
The CW-Inequalities for Vectors in l1
inferredcites →https://doi.org/10.1016/s0195-6698(81)80033-9openalex-snapshot
Matroids and Multicommodity Flows
inferredcites →https://doi.org/10.1016/s0304-0208(08)72955-4openalex-snapshot
Pseudo-Boolean Functions and Stability of Graphs
inferredcites →https://doi.org/10.1016/s0304-0208(08)73112-8openalex-snapshot
Consistency of Quadratic Boolean Equations and the König-Egerváry Property for Graphs°°The present Work is part of a doctoral thesis written at the Department of Combinatorics and Optimization, University of Waterloo, under the supervision of Prof. P.L. Hammer.
inferredcites →https://doi.org/10.1093/biomet/56.3.537openalex-snapshot
Maximum Likelihood Paired Comparison Ranking by Linear Programming
inferredcites →https://doi.org/10.1103/physreva.34.4217openalex-snapshot
Collective computational properties of neural networks: New learning mechanisms
inferredcites →https://doi.org/10.1109/12.90255openalex-snapshot
The orientation of modules based on graph decomposition
inferredcites →https://doi.org/10.1109/iccad.1988.122540openalex-snapshot
Automatic test generation using neural networks
inferredcites →https://doi.org/10.1109/mc.1982.1653826openalex-snapshot
Introduction to the configurable, highly parallel computer
inferredcites →https://doi.org/10.1109/t-c.1975.224205openalex-snapshot
Polynomially Complete Fault Detection Problems
inferredcites →https://doi.org/10.1109/tc.1977.1674880openalex-snapshot
Optimal Test Generation in Combinational Networks by Pseudo-Boolean Programming
inferredcites →https://doi.org/10.1109/tse.1977.233840openalex-snapshot
Multiprocessor Scheduling with the Aid of Network Flow Algorithms
inferredcites →https://doi.org/10.1109/tse.1978.231502openalex-snapshot
Critical Load Factors in Two-Processor Distributed Systems
inferredcites →https://doi.org/10.1137/0204019openalex-snapshot
Finding a Maximum Cut of a Planar Graph in Polynomial Time
inferredcites →https://doi.org/10.1137/0405014openalex-snapshot
Chvátal Cuts and Odd Cycle Inequalities in Quadratic 0–1 Optimization
inferredcites →https://doi.org/10.1137/0603052openalex-snapshot
Vertices Belonging to All or to No Maximum Stable Sets of a Graph
inferredcites →https://doi.org/10.1287/mnsc.17.3.200openalex-snapshot
A Selection Problem of Shared Fixed Costs and Network Flows
inferredcites →https://doi.org/10.1287/moor.10.2.340openalex-snapshot
Facets of the Bipartite Subgraph Polytope
inferredcites →https://doi.org/10.1287/moor.10.2.359openalex-snapshot
Testing the Odd Bicycle Wheel Inequalities for the Bipartite Subgraph Polytope
inferredcites →https://doi.org/10.1287/moor.18.1.245openalex-snapshot
Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions
inferredcites →https://doi.org/10.1287/opre.13.3.388openalex-snapshot
Some Network Flow Problems Solved with Pseudo-Boolean Programming
inferredcites →https://doi.org/10.1287/opre.18.3.454openalex-snapshot
Quadratic Binary Programming with Application to Capital-Budgeting Problems
inferredcites →https://doi.org/10.1287/opre.22.5.1081openalex-snapshot
Pseudo-Boolean Solutions to Multidimensional Location Problems
inferredcites →https://doi.org/10.1287/opre.26.3.422openalex-snapshot
A Cut Approach to the Rectilinear Distance Facility Location Problem
inferredcites →https://doi.org/10.1287/opre.36.3.493openalex-snapshot
An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
inferredcites →https://doi.org/10.1287/trsc.26.2.138openalex-snapshot
Boolean and Graph Theoretic Formulations of the Simple Plant Location Problem
inferredcites →https://doi.org/10.1307/mmj/1028989917openalex-snapshot
On the notion of balance of a signed graph.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4785954openalex-extracted
Hybrid Basic Algorithm for Unconstrained Binary Nonlinear Programming
inferred← citeshttps://doi.org/10.1007/0-387-25383-1_1openalex-snapshot
Metaheuristic Agent Processes (MAPS)
inferred← citeshttps://doi.org/10.1007/0-387-29550-x_4openalex-snapshot
A Unified Framework for Modeling and Solving Combinatorial Optimization Problems: A Tutorial
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_15openalex-snapshot
Binary Unconstrained Quadratic Optimization Problem
inferred← citeshttps://doi.org/10.1007/978-1-4614-6624-6_15-1openalex-snapshot
QUBO: Quadratic Unconstrained Binary Optimization Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-04520-2_2openalex-snapshot
Applications and Computational Advances for Solving the QUBO Model
inferred← citeshttps://doi.org/10.1007/978-3-540-73556-4_32openalex-snapshot
A New Exact Algorithm for the Two-Sided Crossing Minimization Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-38189-8_15openalex-snapshot
Solving k-Way Graph Partitioning Problems to Optimality: The Impact of Semidefinite Relaxations and the Bundle Method
inferred← citeshttps://doi.org/10.1007/bf01580072openalex-snapshot
Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
inferred← citeshttps://doi.org/10.1007/s00291-003-0153-3openalex-snapshot
A unified modeling and solution framework for combinatorial optimization problems
inferred← citeshttps://doi.org/10.1007/s00607-005-0153-zopenalex-snapshot
A Tight Lower Bound for a Special Case of Quadratic 0–1 Programming
inferred← citeshttps://doi.org/10.1007/s10107-010-0352-zopenalex-snapshot
Binary positive semidefinite matrices and associated integer polytopes
inferred← citeshttps://doi.org/10.1007/s10107-017-1158-zopenalex-snapshot
On decomposability of Multilinear sets
inferred← citeshttps://doi.org/10.1007/s10288-018-0392-4openalex-snapshot
Linear and quadratic reformulations of nonlinear optimization problems in binary variables
inferred← citeshttps://doi.org/10.1007/s10288-019-00424-yopenalex-snapshot
Quantum Bridge Analytics I: a tutorial on formulating and using QUBO models
inferred← citeshttps://doi.org/10.1007/s10479-008-0481-4openalex-snapshot
A branch-and-cut algorithm based on semidefinite programming for the minimum k-partition problem
inferred← citeshttps://doi.org/10.1007/s10479-011-0913-4openalex-snapshot
The mathematics of Peter L. Hammer (1936–2006): graphs, optimization, and Boolean models
inferred← citeshttps://doi.org/10.1007/s10479-015-2076-1openalex-snapshot
f-Flip strategies for unconstrained binary quadratic programming
inferred← citeshttps://doi.org/10.1007/s10479-016-2234-0openalex-snapshot
A multiple search operator heuristic for the max-k-cut problem
inferred← citeshttps://doi.org/10.1007/s10479-022-04634-2openalex-snapshot
Quantum bridge analytics I: a tutorial on formulating and using QUBO models
inferred← citeshttps://doi.org/10.1007/s10589-010-9335-5openalex-snapshot
Partitioning planar graphs: a fast combinatorial approach for max-cut
inferred← citeshttps://doi.org/10.1007/s10732-007-9009-3openalex-snapshot
Local search heuristics for Quadratic Unconstrained Binary Optimization (QUBO)
inferred← citeshttps://doi.org/10.1007/s10732-011-9171-5openalex-snapshot
On characterization of maximal independent sets via quadratic optimization
inferred← citeshttps://doi.org/10.1007/s10732-011-9189-8openalex-snapshot
Solving large scale Max Cut problems via tabu search
inferred← citeshttps://doi.org/10.1007/s10878-006-9625-0openalex-snapshot
Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem
inferred← citeshttps://doi.org/10.1007/s10878-009-9212-2openalex-snapshot
Separator-based data reduction for signed graph balancing
inferred← citeshttps://doi.org/10.1007/s10878-014-9734-0openalex-snapshot
The unconstrained binary quadratic programming problem: a survey
inferred← citeshttps://doi.org/10.1007/s10898-025-01586-2openalex-snapshot
Quadratic convex reformulations for multiObjective binary quadratic programming
inferred← citeshttps://doi.org/10.1007/s10957-025-02883-2openalex-snapshot
A Vectorized Positive Semidefinite Penalty Method for Unconstrained Binary Quadratic Programming
inferred← citeshttps://doi.org/10.1007/s11590-012-0458-8openalex-snapshot
A new penalty parameter for linearly constrained 0–1 quadratic programming problems
inferred← citeshttps://doi.org/10.1016/0377-0427(94)90020-5openalex-snapshot
Applications of cut polyhedra — I
inferred← citeshttps://doi.org/10.1016/0377-0427(94)90021-3openalex-snapshot
Applications of cut polyhedra — II
inferred← citeshttps://doi.org/10.1016/j.cie.2017.07.012openalex-snapshot
Simple and fast novel diversification approach for the UBQP based on sequential improvement local search
inferred← citeshttps://doi.org/10.1016/j.cor.2023.106324openalex-snapshot
Fast 1-flip neighborhood evaluations for large-scale pseudo-Boolean optimization using posiform representation
inferred← citeshttps://doi.org/10.1016/j.cor.2024.106684openalex-snapshot
A large population island framework for the unconstrained binary quadratic problem
inferred← citeshttps://doi.org/10.1016/j.dam.2004.07.007openalex-snapshot
Minimization of ordered, symmetric half-products
inferred← citeshttps://doi.org/10.1016/j.dam.2015.04.004openalex-snapshot
The bipartite unconstrained 0–1 quadratic programming problem: Polynomially solvable cases
inferred← citeshttps://doi.org/10.1016/j.disopt.2007.02.001openalex-snapshot
A max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)
inferred← citeshttps://doi.org/10.1016/j.disopt.2018.06.004openalex-snapshot
The generalized vertex cover problem and some variations
inferred← citeshttps://doi.org/10.1016/j.disopt.2019.02.002openalex-snapshot
Global optimization of multilevel electricity market models including network design and graph partitioning
inferred← citeshttps://doi.org/10.1016/j.ejor.2010.02.042openalex-snapshot
Spectral bounds for unconstrained (−1,1)-quadratic optimization problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2018.07.045openalex-snapshot
Berge-acyclic multilinear 0–1 optimization problems
inferred← citeshttps://doi.org/10.1016/j.ipl.2023.106390openalex-snapshot
On optimization problems in acyclic hypergraphs
inferred← citeshttps://doi.org/10.1016/j.laa.2015.09.043openalex-snapshot
New bounds for the max-k-cut and chromatic number of a graph
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.02.021openalex-snapshot
QUBO formulations of the longest path problem
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00341-9openalex-snapshot
Pseudo-Boolean optimization
inferred← citeshttps://doi.org/10.1016/s0377-2217(97)00196-3openalex-snapshot
The line index and minimum cut of weighted graphs
inferred← citeshttps://doi.org/10.1023/a:1008293029350openalex-snapshot
A Polyhedral Approach for Nonconvex Quadratic Programming Problems with Box Constraints
inferred← citeshttps://doi.org/10.1023/b:anor.0000039522.58036.68openalex-snapshot
Multistart Tabu Search Strategies for the Unconstrained Binary Quadratic Optimization Problem
inferred← citeshttps://doi.org/10.1063/5.0060481openalex-snapshot
Machine learning framework for quantum sampling of highly constrained, continuous optimization problems
inferred← citeshttps://doi.org/10.1080/02331930902928757openalex-snapshot
A filled function method for quadratic programs with binary constraints†
inferred← citeshttps://doi.org/10.1080/10556788.2017.1401069openalex-snapshot
Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches
inferred← citeshttps://doi.org/10.1103/physrevapplied.18.034016openalex-snapshot
Quadratic Unconstrained Binary Optimisation via Quantum-Inspired Annealing
inferred← citeshttps://doi.org/10.1109/access.2018.2885313openalex-snapshot
PCI Planning Based on Binary Quadratic Programming in LTE/LTE-A Networks
inferred← citeshttps://doi.org/10.1109/access.2022.3197176openalex-snapshot
Rejection-Free Monte Carlo Simulation of QUBO and Lechner–Hauke–Zoller Optimization Problems
inferred← citeshttps://doi.org/10.1109/hpec62836.2024.10938438openalex-snapshot
A Multilevel Approach for Solving Large-Scale QUBO Problems with Noisy Hybrid Quantum Approximate Optimization
inferred← citeshttps://doi.org/10.1109/icdmw58026.2022.00036openalex-snapshot
Towards Practical Explainability with Cluster Descriptors
inferred← citeshttps://doi.org/10.1109/icrc.2017.8123654openalex-snapshot
Reducing Binary Quadratic Forms for More Scalable Quantum Annealing
inferred← citeshttps://doi.org/10.1109/qce65121.2025.00017openalex-snapshot
Standardization of Multi-Objective QUBOs
inferred← citeshttps://doi.org/10.1109/sec54971.2022.00056openalex-snapshot
Scaling Vehicle Routing Problem Solvers with QUBO-based Specialized Hardware
inferred← citeshttps://doi.org/10.1109/tsp.2025.3604409openalex-snapshot
Relaxation-Free Min-$k$-Partition for PCI Assignment in 5G Networks
inferred← citeshttps://doi.org/10.1109/vlsisoc.2010.5642618openalex-snapshot
Fine-grained post placement voltage assignment considering level shifter overhead
inferred← citeshttps://doi.org/10.1111/itor.13420openalex-snapshot
New advances for quantum‐inspired optimization
inferred← citeshttps://doi.org/10.1145/3624062.3624225openalex-snapshot
An Ising-based Model for Qubit Mapping
inferred← citeshttps://doi.org/10.1145/3747521openalex-snapshot
A Haskell Adiabatic DSL: Solving Classical Optimization Problems on Quantum Hardware
inferred← citeshttps://doi.org/10.1162/tacl_a_00187openalex-snapshot
2-Slave Dual Decomposition for Generalized Higher Order CRFs
inferred← citeshttps://doi.org/10.1287/moor.2016.0804openalex-snapshot
A Polyhedral Study of Binary Polynomial Programs
inferred← citeshttps://doi.org/10.15388/informatica.2006.138openalex-snapshot
Iterated Tabu Search for the Unconstrained Binary Quadratic Optimization Problem
inferred← citeshttps://doi.org/10.3389/fphy.2014.00005openalex-snapshot
Ising formulations of many NP problems
inferred← citeshttps://doi.org/10.37236/29openalex-snapshot
A Mathematical Bibliography of Signed and Gain Graphs and Allied Areas
inferred← citeshttps://doi.org/10.48550/arxiv.1210.3962openalex-snapshot
Improved Canonical Dual Algorithms for the Maxcut Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1706.00037openalex-snapshot
A Diversified Multi-Start Algorithm for Unconstrained Binary Quadratic Problems Leveraging the Graphics Processor Unit
inferred← citeshttps://doi.org/10.48550/arxiv.1709.07511openalex-snapshot
Robust Optimization of Unconstrained Binary Quadratic Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1811.11538openalex-snapshot
A Tutorial on Formulating and Using QUBO Models
inferred← citeshttps://doi.org/10.48550/arxiv.1907.04484openalex-snapshot
Co-training for Policy Learning
inferred← citeshttps://doi.org/10.5753/ercemapi.2024.243782openalex-snapshot
Análise de dados em instâncias do problema do corte máximo em grafos
inferred← citeshttps://doi.org/10.70675/d8d31cecza123z48adz86b7ze8a30aaa7c58openalex-snapshot
Quantum many-body dynamics for combinatorial optimisation and machine learning
inferred← citeshttps://doi.org/10.7282/t3sb4419openalex-snapshot
Two applications of combinatorial optimization
inferred← citeshttps://doi.org/10.7566/jpsj.94.013001openalex-snapshot
Advantages of Fixing Spins in Quantum Annealing
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.