On the public citation graph
Computational aspects of a branch and bound algorithm for quadratic zero-one programming
0 signed · 266 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.1002/net.3230050405openalex-snapshot
Minimum cuts and related problems
inferredcites →https://doi.org/10.1007/bf01587084openalex-snapshot
Experiments in quadratic 0–1 programming
inferredcites →https://doi.org/10.1007/bf02253896openalex-snapshot
An efficient branch and bound algorithm to solve the quadratic integer programming problem
inferredcites →https://doi.org/10.1007/bf02612354openalex-snapshot
Roof duality, complementation and persistency in quadratic 0–1 optimization
inferredcites →https://doi.org/10.1007/bfb0000035openalex-snapshot
Constrained Global Optimization: Algorithms and Applications
inferredcites →https://doi.org/10.1016/0166-218x(84)90111-2openalex-snapshot
The indefinite zero-one quadratic problem
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/0377-2217(84)90054-7openalex-snapshot
An improved enumerative algorithm for solving quadratic zero-one programming
inferredcites →https://doi.org/10.1016/0377-2217(84)90055-9openalex-snapshot
Unconstrained quadratic bivalent programming problem
inferredcites →https://doi.org/10.1016/0898-1221(91)90165-zopenalex-snapshot
Graph separation techniques for quadratic zero-one programming
inferredcites →https://doi.org/10.1016/s0167-5060(08)70343-1openalex-snapshot
Methods of Nonlinear 0-1 Programming
inferredcites →https://doi.org/10.1145/103147.103156openalex-snapshot
Construction of test problems in quadratic bivalent programming
inferredcites →https://doi.org/10.1147/sj.82.0136openalex-snapshot
A pseudo-random number generator for the System/360
inferredcites →https://doi.org/10.1287/mnsc.26.3.282openalex-snapshot
An Implicit Enumeration Algorithm for Quadratic Integer Programming
inferredcites →https://doi.org/10.1287/mnsc.27.3.353openalex-snapshot
A Survey of Methods for Pure Nonlinear Integer Programming
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.4849930openalex-extracted
Quantum Computing Winks at Statistics. Is It a Good Match?
inferred← citeshttps://doi.org/10.5281/zenodo.1081850openalex-extracted
Perturbation Based Search Method For Solving Unconstrained Binary Quadratic Programming Problem
inferred← citeshttps://doi.org/10.1002/(sici)1520-6750(200003)47:2<97::aid-nav2>3.0.co;2-2openalex-snapshot
Lagrangian solution of maximum dispersion problems
inferred← citeshttps://doi.org/10.1002/1520-6750(199304)40:3<373::aid-nav3220400307>3.0.co;2-aopenalex-snapshot
Global minimization of indefinite quadratic functions subject to box constraints
inferred← citeshttps://doi.org/10.1002/9781118600245.ch8openalex-snapshot
Quadratic Optimization in 0–1 Variables
inferred← citeshttps://doi.org/10.1002/9781119005216.ch8openalex-snapshot
Quadratic Optimization in 0–1 Variables
inferred← citeshttps://doi.org/10.1002/net.21751openalex-snapshot
Quadratic unconstrained binary optimization problem preprocessing: Theory and empirical analysis
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_195openalex-snapshot
Graph coloring; Greedy randomized adaptive search procedures; Heuristics for maximum clique and independent set; Replicator dynamics in combinatorial optimization HEURISTICS FOR MAXIMUM CLIQUE AND INDEPENDENT SET
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_91openalex-snapshot
Differential Equations and Global Optimization
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/1-4020-7782-3_5openalex-snapshot
Solving Combinatorial Optimization Problems Via Reformulation and Adaptive Memory Metaheuristics
inferred← citeshttps://doi.org/10.1007/3-540-31182-3_1openalex-snapshot
An Evolutionary Algorithm for the Unconstrained Binary Quadratic Problems
inferred← citeshttps://doi.org/10.1007/978-0-387-09770-1_10openalex-snapshot
Optimization and Data Mining in Epilepsy Research: A Review and Prospective
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_125openalex-snapshot
Differential Equations and Global Optimization
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_264openalex-snapshot
Heuristics for Maximum Clique and Independent Set
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_433openalex-snapshot
Multi-Quadratic Integer Programming: Models and Applications
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_536openalex-snapshot
Quadratic Integer Programming: Complexity and Equivalent Forms
inferred← citeshttps://doi.org/10.1007/978-0-387-75714-8_4openalex-snapshot
Time—Frequency Analysis of Brain Neurodynamics
inferred← citeshttps://doi.org/10.1007/978-0-387-89496-6_11openalex-snapshot
Polynomially Solvable Cases of Binary Quadratic Programs
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-4613-0225-4_1openalex-snapshot
Applications of Global Optimization and Dynamical Systems to Prediction of Epileptic Seizures
inferred← citeshttps://doi.org/10.1007/978-1-4613-8354-3_5openalex-snapshot
Eigenvalues in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4614-5286-7_2openalex-snapshot
Maximization of Submodular Functions: Theory and Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4614-5286-7_3openalex-snapshot
Data Correcting Approach for the Maximization of Submodular Functions
inferred← citeshttps://doi.org/10.1007/978-1-4614-5286-7_4openalex-snapshot
Data Correcting Approach for the Simple Plant Location 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-1-4615-5775-3_7openalex-snapshot
Tabu Search with Critical Event Memory: An Enhanced Application for Binary Quadratic Programs
inferred← citeshttps://doi.org/10.1007/978-1-4757-2600-8_5openalex-snapshot
Quadratic Programming with Box Constraints
inferred← citeshttps://doi.org/10.1007/978-1-4757-3023-4_1openalex-snapshot
The Maximum Clique Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-04179-3_51openalex-snapshot
A Neural Network Based Global Optimal Algorithm for Unconstrained Binary Quadratic Programming Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-21803-4_3openalex-snapshot
A Sequential Linear Programming Algorithm for Continuous and Mixed-Integer Nonconvex Quadratic Programming
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_536-1openalex-snapshot
Quadratic Integer Programming: Complexity and Equivalent Forms
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_853-1openalex-snapshot
QUBO Formulations of Combinatorial Optimization Problems for Quantum Computing Devices
inferred← citeshttps://doi.org/10.1007/978-3-031-04520-2_6openalex-snapshot
Mathematical Programming Models and Exact Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-031-62912-9_22openalex-snapshot
Utilizing Graph Sparsification for Pre-processing in Max Cut QUBO Solver
inferred← citeshttps://doi.org/10.1007/978-3-319-09039-9_17openalex-snapshot
DC Programming and DCA for Challenging Problems in Bioinformatics and Computational Biology
inferred← citeshttps://doi.org/10.1007/978-3-319-12436-0_38openalex-snapshot
A Polynomial Time Solvable Algorithm to Binary Quadratic Programming Problems with Q Being a Seven-Diagonal Matrix and Its Neural Network Implementation
inferred← citeshttps://doi.org/10.1007/978-3-319-18167-7_27openalex-snapshot
Solving the Production and Maintenance Optimization Problem by a Global Approach
inferred← citeshttps://doi.org/10.1007/978-3-319-92537-0_23openalex-snapshot
An Artificial Neural Network for Solving Quadratic Zero-One Programming Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-25960-2_32openalex-snapshot
Optimizing over Semimetric Polytopes
inferred← citeshttps://doi.org/10.1007/978-3-540-72792-7_23openalex-snapshot
A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations
inferred← citeshttps://doi.org/10.1007/978-3-642-12139-5_14openalex-snapshot
A Study of Memetic Search with Multi-parent Combination for UBQP
inferred← citeshttps://doi.org/10.1007/978-3-642-29828-8_26openalex-snapshot
A Multilevel Algorithm for Large Unconstrained Binary Quadratic Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-56645-5_3openalex-snapshot
Cuts and Semidefinite Relaxations for Nonconvex Quadratic Problems
inferred← citeshttps://doi.org/10.1007/bf01096724openalex-snapshot
A quadratic assignment formulation of the molecular conformation problem
inferred← citeshttps://doi.org/10.1007/bf01432506openalex-snapshot
Testing optimality for quadratic 0?1 unconstrained problems
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/bf02238072openalex-snapshot
Node and edge relaxations of the Max-cut problem
inferred← citeshttps://doi.org/10.1007/bf02238228openalex-snapshot
A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming
inferred← citeshttps://doi.org/10.1007/bfb0023911openalex-snapshot
A 0–1 quadratic knapsack problem for modelizing and solving the constraint satisfaction problems
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/s00357-007-0014-xopenalex-snapshot
Algorithms for ℓ1-Embeddability and Related Problems
inferred← citeshttps://doi.org/10.1007/s003579900014openalex-snapshot
A modification of the SINDCLUS algorithm for fitting the ADCLUS and INDCLUS models
inferred← citeshttps://doi.org/10.1007/s00500-019-03987-4openalex-snapshot
A dynamic line generation and vehicle scheduling method for airport bus line based on multi-source big travel data
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/s10100-026-01027-9openalex-snapshot
Penalty method for cardinality constrained optimization problems with an application in portfolio theory
inferred← citeshttps://doi.org/10.1007/s10107-004-0529-4openalex-snapshot
Seizure warning algorithm based on optimization and nonlinear dynamics
inferred← citeshttps://doi.org/10.1007/s10107-005-0594-3openalex-snapshot
Perspective cuts for a class of convex 0–1 mixed integer programs
inferred← citeshttps://doi.org/10.1007/s10107-005-0637-9openalex-snapshot
Using a Mixed Integer Quadratic Programming Solver for the Unconstrained Quadratic 0-1 Problem
inferred← citeshttps://doi.org/10.1007/s10107-005-0661-9openalex-snapshot
Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and Equipartition
inferred← citeshttps://doi.org/10.1007/s10107-008-0235-8openalex-snapshot
Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations
inferred← citeshttps://doi.org/10.1007/s10107-010-0412-4openalex-snapshot
Two-stage quadratic integer programs with stochastic right-hand sides
inferred← citeshttps://doi.org/10.1007/s10107-012-0594-zopenalex-snapshot
Improved semidefinite bounding procedure for solving Max-Cut problems to optimality
inferred← citeshttps://doi.org/10.1007/s10107-012-0628-6openalex-snapshot
On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0–1 quadratic problems leading to quasi-Newton methods
inferred← citeshttps://doi.org/10.1007/s101070050064openalex-snapshot
Testing optimality for quadratic 0-1 problems
inferred← citeshttps://doi.org/10.1007/s10288-009-0115-yopenalex-snapshot
Diversification-driven tabu search for unconstrained binary quadratic problems
inferred← citeshttps://doi.org/10.1007/s10288-012-0210-3openalex-snapshot
Semidefinite relaxations for partitioning, assignment and ordering problems
inferred← citeshttps://doi.org/10.1007/s10288-018-0372-8openalex-snapshot
The multiplicative weights update algorithm for mixed integer nonlinear programming: theory, applications, and limitations
inferred← citeshttps://doi.org/10.1007/s10479-005-3449-7openalex-snapshot
An Unconstrained Quadratic Binary Programming Approach to the Vertex Coloring Problem
inferred← citeshttps://doi.org/10.1007/s10479-015-2015-1openalex-snapshot
Semidefinite relaxations for partitioning, assignment and ordering problems
inferred← citeshttps://doi.org/10.1007/s10589-005-3062-3openalex-snapshot
Lower Bound Improvement and Forcing Rule for Quadratic Binary Programming
inferred← citeshttps://doi.org/10.1007/s10589-016-9844-yopenalex-snapshot
Building an iterative heuristic solver for a quantum annealer
inferred← citeshttps://doi.org/10.1007/s10589-016-9856-7openalex-snapshot
On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study
inferred← citeshttps://doi.org/10.1007/s10589-018-9985-2openalex-snapshot
Convergence of a Scholtes-type regularization method for cardinality-constrained optimization problems with an application in sparse robust portfolio optimization
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-007-9054-yopenalex-snapshot
Simple and fast surrogate constraint heuristics for the maximum independent set problem
inferred← citeshttps://doi.org/10.1007/s10732-011-9169-zopenalex-snapshot
Several versions of the devour digest tidy-up heuristic for unconstrained binary quadratic problems
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-021-09471-3openalex-snapshot
Qfold: a new modeling paradigm for the RNA folding problem
inferred← citeshttps://doi.org/10.1007/s10732-022-09498-0openalex-snapshot
Data structures for speeding up Tabu Search when solving sparse quadratic unconstrained binary optimization problems
inferred← citeshttps://doi.org/10.1007/s10852-005-9030-1openalex-snapshot
Hybridization of GRASP Metaheuristic with Data Mining Techniques
inferred← citeshttps://doi.org/10.1007/s10878-008-9194-5openalex-snapshot
Periodic complementary binary sequences and Combinatorial Optimization algorithms
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/s10878-016-0045-5openalex-snapshot
A new effective branch-and-bound algorithm to the high order MIMO detection problem
inferred← citeshttps://doi.org/10.1007/s10898-004-5909-zopenalex-snapshot
A Multilevel Search Algorithm for the Maximization of Submodular Functions Applied to the Quadratic Cost Partition Problem
inferred← citeshttps://doi.org/10.1007/s10898-007-9167-8openalex-snapshot
Box-constrained quadratic programs with fixed charge variables
inferred← citeshttps://doi.org/10.1007/s10898-009-9416-0openalex-snapshot
Global optimality conditions for quadratic 0-1 optimization problems
inferred← citeshttps://doi.org/10.1007/s10898-009-9504-1openalex-snapshot
An improved lower bound and approximation algorithm for binary constrained quadratic programming problem
inferred← citeshttps://doi.org/10.1007/s10898-009-9507-yopenalex-snapshot
An efficient combined DCA and B&B using DC/SDP relaxation for globally solving binary quadratic programs
inferred← citeshttps://doi.org/10.1007/s10898-009-9520-1openalex-snapshot
Linear and quadratic programming approaches for the general graph partitioning problem
inferred← citeshttps://doi.org/10.1007/s10898-011-9650-0openalex-snapshot
Global optimality conditions and optimization methods for quadratic integer programming problems
inferred← citeshttps://doi.org/10.1007/s10898-011-9713-2openalex-snapshot
An exact solution method for unconstrained quadratic 0–1 programming: a geometric approach
inferred← citeshttps://doi.org/10.1007/s10898-014-0263-2openalex-snapshot
A polynomial case of convex integer quadratic programming problems with box integer constraints
inferred← citeshttps://doi.org/10.1007/s10898-016-0436-2openalex-snapshot
An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints
inferred← citeshttps://doi.org/10.1007/s10898-017-0591-0openalex-snapshot
Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint
inferred← citeshttps://doi.org/10.1007/s10898-018-0726-yopenalex-snapshot
A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming
inferred← citeshttps://doi.org/10.1007/s10898-021-01108-wopenalex-snapshot
New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming
inferred← citeshttps://doi.org/10.1007/s10957-010-9653-xopenalex-snapshot
Separable Relaxation for Nonconvex Quadratic Integer Programming: Integer Diagonalization Approach
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/s11063-019-10122-9openalex-snapshot
Global Optimization of Binary Quadratic Programming: A Neural Network Based Algorithm and Its FPGA Implementation
inferred← citeshttps://doi.org/10.1007/s11075-021-01075-zopenalex-snapshot
A neurodynamic approach to zero-one quadratic programming
inferred← citeshttps://doi.org/10.1007/s11517-014-1176-4openalex-snapshot
Binary optimization for source localization in the inverse problem of ECG
inferred← citeshttps://doi.org/10.1007/s11590-006-0007-4openalex-snapshot
An effective modeling and solution approach for the generalized independent set problem
inferred← citeshttps://doi.org/10.1007/s11590-006-0019-0openalex-snapshot
An improved linearization strategy for zero-one quadratic programming problems
inferred← citeshttps://doi.org/10.1007/s11590-007-0053-6openalex-snapshot
Global minimization of difference of quadratic and convex functions over box or binary constraints
inferred← citeshttps://doi.org/10.1007/s11590-010-0188-8openalex-snapshot
New formulations of the multiple sequence alignment problem
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.1007/s11590-014-0768-0openalex-snapshot
Convex reformulation for binary quadratic programming problems via average objective value maximization
inferred← citeshttps://doi.org/10.1007/s12532-018-0142-9openalex-snapshot
New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation
inferred← citeshttps://doi.org/10.1007/s40305-014-0046-yopenalex-snapshot
Optimization Methods for Mixed Integer Weakly Concave Programming Problems
inferred← citeshttps://doi.org/10.1007/s40314-020-01317-1openalex-snapshot
A successive linear approximation algorithm for the global minimization of a concave quadratic program
inferred← citeshttps://doi.org/10.1007/springerreference_72614openalex-snapshot
Quadratic Integer Programming: Complexity and Equivalent Forms
inferred← citeshttps://doi.org/10.1016/0031-3203(94)90007-8openalex-snapshot
Rulegraphs for graph matching in pattern recognition
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00155-7openalex-snapshot
Solving the max-cut problem using eigenvalues
inferred← citeshttps://doi.org/10.1016/0167-6377(92)90043-3openalex-snapshot
Complexity of uniqueness and local search in quadratic 0–1 programming
inferred← citeshttps://doi.org/10.1016/0167-6377(96)00025-9openalex-snapshot
Computational aspects of the maximum diversity problem
inferred← citeshttps://doi.org/10.1016/0305-0548(90)90011-uopenalex-snapshot
CON due-date determination and sequencing
inferred← citeshttps://doi.org/10.1016/0305-0548(92)90067-fopenalex-snapshot
A branch and bound algorithm for the maximum clique problem
inferred← citeshttps://doi.org/10.1016/0377-2217(94)00229-0openalex-snapshot
Linear programming for the 0–1 quadratic knapsack problem
inferred← citeshttps://doi.org/10.1016/0377-2217(94)90125-2openalex-snapshot
Minimization of a quadratic pseudo-Boolean function
inferred← citeshttps://doi.org/10.1016/0925-5273(94)90034-5openalex-snapshot
Solving a generalized model for CON due date assignment and sequencing
inferred← citeshttps://doi.org/10.1016/b978-0-443-24066-9.00074-xopenalex-snapshot
Applications to biomedicine
inferred← citeshttps://doi.org/10.1016/j.asoc.2013.11.008openalex-snapshot
A hybrid metaheuristic for multiobjective unconstrained binary quadratic programming
inferred← citeshttps://doi.org/10.1016/j.biosystems.2004.08.002openalex-snapshot
Memetic algorithms for the unconstrained binary quadratic programming problem
inferred← citeshttps://doi.org/10.1016/j.cam.2003.08.012openalex-snapshot
Best ellipsoidal relaxation to solve a nonconvex problem
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.clinph.2004.10.013openalex-snapshot
Long-term prospective on-line real-time seizure prediction
inferred← citeshttps://doi.org/10.1016/j.cor.2011.09.008openalex-snapshot
Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem
inferred← citeshttps://doi.org/10.1016/j.cor.2011.12.006openalex-snapshot
Probabilistic GRASP-Tabu Search algorithms for the UBQP problem
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.2007.12.008openalex-snapshot
Improved compact linearizations for the unconstrained quadratic 0–1 minimization problem
inferred← citeshttps://doi.org/10.1016/j.disopt.2024.100858openalex-snapshot
Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations
inferred← citeshttps://doi.org/10.1016/j.ejor.2008.06.005openalex-snapshot
The equitable dispersion problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2008.06.033openalex-snapshot
A trust branching path heuristic for zero–one programming
inferred← citeshttps://doi.org/10.1016/j.ejor.2010.06.039openalex-snapshot
A hybrid metaheuristic approach to solving the UBQP problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2011.09.016openalex-snapshot
A column generation approach for the unconstrained binary quadratic programming problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2012.07.012openalex-snapshot
Path relinking for unconstrained binary quadratic programming
inferred← citeshttps://doi.org/10.1016/j.ejor.2017.08.025openalex-snapshot
Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2018.09.028openalex-snapshot
Quadratic convex reformulation for quadratic programming with linear on–off constraints
inferred← citeshttps://doi.org/10.1016/j.eplepsyres.2005.03.009openalex-snapshot
Performance of a seizure warning algorithm based on the dynamics of intracranial EEG
inferred← citeshttps://doi.org/10.1016/j.ijrobp.2008.10.088openalex-snapshot
Four-Dimensional Intensity-Modulated Radiotherapy Planning for Dynamic Multileaf Collimator Tracking Radiotherapy
inferred← citeshttps://doi.org/10.1016/j.knosys.2020.106366openalex-snapshot
Heuristic algorithms based on deep reinforcement learning for quadratic unconstrained binary optimization
inferred← citeshttps://doi.org/10.1016/j.neucom.2015.09.130openalex-snapshot
Polynomial time solvable algorithms to a class of unconstrained and linearly constrained binary quadratic programming problems
inferred← citeshttps://doi.org/10.1016/j.neucom.2016.12.064openalex-snapshot
An artificial neural network for solving quadratic zero-one programming problems
inferred← citeshttps://doi.org/10.1016/j.orl.2004.03.005openalex-snapshot
A new linearization technique for multi-quadratic 0–1 programming problems
inferred← citeshttps://doi.org/10.1016/j.orl.2006.03.008openalex-snapshot
SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
inferred← citeshttps://doi.org/10.1016/j.sorms.2012.08.001openalex-snapshot
Non-convex mixed-integer nonlinear programming: A survey
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00317-6openalex-snapshot
Comparison of column generation models for channel assignment in cellular networks
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00176-2openalex-snapshot
Erratum to “Comparison of column generation models for channel assignment in cellular networks”
inferred← citeshttps://doi.org/10.1016/s0168-9002(97)00089-2openalex-snapshot
Global optimization for track finding
inferred← citeshttps://doi.org/10.1016/s0305-0548(02)00028-xopenalex-snapshot
Modelling competitive Hopfield networks for the maximum clique problem
inferred← citeshttps://doi.org/10.1016/s0360-8352(00)00043-7openalex-snapshot
A comparison between simulated annealing, genetic algorithm and tabu search methods for the unconstrained quadratic Pseudo-Boolean function
inferred← citeshttps://doi.org/10.1016/s0377-2217(00)00242-3openalex-snapshot
Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem
inferred← citeshttps://doi.org/10.1016/s0377-2217(01)00209-0openalex-snapshot
One-pass heuristics for large-scale unconstrained binary quadratic problems
inferred← citeshttps://doi.org/10.1016/s0377-2217(97)00130-6openalex-snapshot
Simulated annealing for the unconstrained quadratic pseudo-Boolean function
inferred← citeshttps://doi.org/10.1016/s0377-2217(98)00359-2openalex-snapshot
An evolutionary heuristic for quadratic 0–1 programming
inferred← citeshttps://doi.org/10.1021/acs.jctc.5c00948openalex-snapshot
Bridging Quantum Chemistry and MaxCut: Classical Performance Guarantees and Quantum Algorithms for the Hartree–Fock Method
inferred← citeshttps://doi.org/10.1023/a:1008240227198openalex-snapshot
A Branch and Bound Method via d.c. Optimization Algorithms and Ellipsoidal Technique for Box Constrained Nonconvex Quadratic Problems
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/a:1008397325409openalex-snapshot
A Barrier Function Method for the Nonconvex Quadratic Programming Problem with Box Constraints
inferred← citeshttps://doi.org/10.1023/a:1009877331765openalex-snapshot
Quadratic Binary Programming and Dynamical System Approach to Determine the Predictability of Epileptic Seizures
inferred← citeshttps://doi.org/10.1023/a:1017912624016openalex-snapshot
Greedy and Local Search Heuristics for Unconstrained Binary Quadratic Programming
inferred← citeshttps://doi.org/10.1023/a:1022174505886openalex-snapshot
Penalty Parameter for Linearly Constrained 0–1 Quadratic Programming
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.1023/b:jogo.0000006654.34226.feopenalex-snapshot
Ellipsoidal Approach to Box-Constrained Quadratic Problems
inferred← citeshttps://doi.org/10.1051/ro:2008019openalex-snapshot
Unified global optimality conditions for smooth minimization problems with mixed variables
inferred← citeshttps://doi.org/10.1078/1434-8411-54100169openalex-snapshot
A New Algorithm for Optimum Multiuser Detection in Synchronous CDMA Systems
inferred← citeshttps://doi.org/10.1080/00207169108803967openalex-snapshot
An algorithm for finding a maximum weighted independent set in an arbitrary graph
inferred← citeshttps://doi.org/10.1080/00207729408928968openalex-snapshot
0-1 Quadratic programming approach for optimum solutions of two scheduling problems
inferred← citeshttps://doi.org/10.1080/02331930108844555openalex-snapshot
A continuous approch for globally solving linearly constrained quadratic
inferred← citeshttps://doi.org/10.1080/02331930902928757openalex-snapshot
A filled function method for quadratic programs with binary constraints†
inferred← citeshttps://doi.org/10.1080/02331939208843863openalex-snapshot
Remarks on a difficult test problem for quadratic boolean programming
inferred← citeshttps://doi.org/10.1080/0951192x.2013.800229openalex-snapshot
Solving a two-agent single-machine learning scheduling problem
inferred← citeshttps://doi.org/10.1080/10556780701550083openalex-snapshot
Global equilibrium search applied to the unconstrained binary quadratic optimization problem
inferred← citeshttps://doi.org/10.1109/acssc.2004.1399335openalex-snapshot
Reduced complexity sphere decoding using forcing rules
inferred← citeshttps://doi.org/10.1109/acssc.2012.6489382openalex-snapshot
Detection of Code Spread OFDM based on 0–1 Integer Quadratic Programming
inferred← citeshttps://doi.org/10.1109/cec.2017.7969360openalex-snapshot
A Parallel Tabu Search for the Unconstrained Binary Quadratic Programming problem
inferred← citeshttps://doi.org/10.1109/icassp.1994.390081openalex-snapshot
Minimum mean square error filtering over the class of extended threshold Boolean filters
inferred← citeshttps://doi.org/10.1109/icassp.2000.860990openalex-snapshot
Channel decoding using adaptive interframe and intraframe bit prediction in GSM system
inferred← citeshttps://doi.org/10.1109/icassp.2000.861115openalex-snapshot
A class of coordinate descent methods for multiuser detection
inferred← citeshttps://doi.org/10.1109/icicip.2014.7010280openalex-snapshot
Polynomial time solvable algorithm to linearly constrained binary quadratic programming problems with Q being a five-diagonal matrix
inferred← citeshttps://doi.org/10.1109/icnc52316.2021.9608378openalex-snapshot
An inertial neuro-dynamic system for solving zero-one integer programming
inferred← citeshttps://doi.org/10.1109/icnn.1993.298710openalex-snapshot
Neural networks for solving the quadratic 0-1 programming problem under linear constraints
inferred← citeshttps://doi.org/10.1109/icsmc.2001.972987openalex-snapshot
Speed and accuracy comparison of techniques to solve a binary quadratic programming problem with applications to synchronous CDMA
inferred← citeshttps://doi.org/10.1109/icsmc.2001.972988openalex-snapshot
Performance of various methods for the solution of binary quadratic programming problems
inferred← citeshttps://doi.org/10.1109/ijcnn.1991.170515openalex-snapshot
A parallel neural network computing for the maximum clique problem
inferred← citeshttps://doi.org/10.1109/iscas.1993.394285openalex-snapshot
A parallel computation network for the maximum clique problem
inferred← citeshttps://doi.org/10.1109/iscas.1993.693211openalex-snapshot
A parallel computation network for the maximum clique problem
inferred← citeshttps://doi.org/10.1109/milcom.2012.6415862openalex-snapshot
Detection of Code Spread OFDM based on 0-1 Integer Quadratic Programming
inferred← citeshttps://doi.org/10.1109/sips.1999.822373openalex-snapshot
Design of threshold Boolean filters under MSE criterion by iterative searching
inferred← citeshttps://doi.org/10.1109/ssp.2009.5278581openalex-snapshot
VBLAST detection based on quadratic zero-one programming
showing the first 200 of 249 · page through all 249
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.