On the public citation graph
L’algebre de Boole et ses applications en recherche operationnelle
0 signed · 109 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.1016/0016-0032(59)90044-4openalex-snapshot
Switching circuits and logical design
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
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.21970openalex-snapshot
Optimizing the investments in mobile networks and subscriber migrations for a telecommunication operator
inferred← citeshttps://doi.org/10.1007/978-3-031-59835-7_29openalex-snapshot
Relaxation Strength for Multilinear Optimization: McCormick Strikes Back
inferred← citeshttps://doi.org/10.1007/978-3-031-93112-3_33openalex-snapshot
Implied Integrality in Mixed-Integer Optimization
inferred← citeshttps://doi.org/10.1007/978-3-319-11008-0_2openalex-snapshot
Integer Programming Models
inferred← citeshttps://doi.org/10.1007/978-3-642-51175-2_26openalex-snapshot
Partitioning Problems in Cluster Analysis: A Review of Mathematical Programming Approaches
inferred← citeshttps://doi.org/10.1007/978-3-642-85823-9_4openalex-snapshot
Linear Pseudo-Boolean Equations and Inequalities
inferred← citeshttps://doi.org/10.1007/978-3-658-00873-4_5openalex-snapshot
Dienstleistungsmodularisierung im Krankenhaus – Theoretischer Rahmen und Anwendung
inferred← citeshttps://doi.org/10.1007/978-94-011-7557-9_3openalex-snapshot
Boolean Elements in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-94-011-7557-9_5openalex-snapshot
Chemins et Circuits: Enumeration et Optimisation
inferred← citeshttps://doi.org/10.1007/bf02591796openalex-snapshot
Nonlinear 0–1 programming: I. Linearization techniques
inferred← citeshttps://doi.org/10.1007/bfb0073941openalex-snapshot
Minimization of pseudo-Boolean functions
inferred← citeshttps://doi.org/10.1007/s00186-017-0608-yopenalex-snapshot
Norm bounds and underestimators for unconstrained polynomial integer minimization
inferred← citeshttps://doi.org/10.1007/s10107-016-1032-4openalex-snapshot
Quadratic reformulations of nonlinear binary optimization problems
inferred← citeshttps://doi.org/10.1007/s10107-017-1140-9openalex-snapshot
Matroid optimisation problems with nested non-linear monomials in the objective function
inferred← citeshttps://doi.org/10.1007/s10287-012-0148-0openalex-snapshot
Stochastic nuclear outages semidefinite relaxations
inferred← citeshttps://doi.org/10.1007/s10288-017-0364-0openalex-snapshot
Compact linearization for binary quadratic problems subject to assignment constraints
inferred← citeshttps://doi.org/10.1007/s10288-020-00460-zopenalex-snapshot
Inductive linearization for binary quadratic programs with linear constraints
inferred← citeshttps://doi.org/10.1007/s10479-005-3969-1openalex-snapshot
Projection, Lifting and Extended Formulation in Integer and Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/s10479-005-3973-5openalex-snapshot
“Miniaturized” Linearizations for Quadratic 0/1 Problems
inferred← citeshttps://doi.org/10.1007/s10479-018-3032-7openalex-snapshot
Time consistent expected mean-variance in multistage stochastic quadratic optimization: a model and a matheuristic
inferred← citeshttps://doi.org/10.1007/s10479-018-3092-8openalex-snapshot
Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic 0–1 optimization problems with linear constraints
inferred← citeshttps://doi.org/10.1007/s10479-018-3118-2openalex-snapshot
Theoretical and computational study of several linearisation techniques for binary quadratic problems
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/s10878-004-4838-6openalex-snapshot
From Linear to Semidefinite Programming: An Algorithm to Obtain Semidefinite Relaxations for Bivalent Quadratic Problems
inferred← citeshttps://doi.org/10.1007/s10898-006-9128-7openalex-snapshot
Computing exact solution to nonlinear integer programming: Convergent Lagrangian and objective level cut method
inferred← citeshttps://doi.org/10.1007/s10898-010-9566-0openalex-snapshot
Knapsack problem with probability constraints
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-020-00972-2openalex-snapshot
Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation
inferred← citeshttps://doi.org/10.1007/s10898-022-01184-6openalex-snapshot
Compact mixed-integer programming formulations in quadratic optimization
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-014-0763-5openalex-snapshot
RLT insights into lift-and-project closures
inferred← citeshttps://doi.org/10.1007/s11590-015-0953-9openalex-snapshot
Stochastic graph partitioning: quadratic versus SOCP formulations
inferred← citeshttps://doi.org/10.1007/s11590-019-01460-7openalex-snapshot
Optimal quadratic reformulations of fourth degree Pseudo-Boolean functions
inferred← citeshttps://doi.org/10.1007/s13369-019-03796-9openalex-snapshot
Mixed Integer Programming Formulations for Single Row Facility Layout Problems with Asymmetric Material Flow and Corridor Width
inferred← citeshttps://doi.org/10.1007/s13675-014-0033-4openalex-snapshot
A linear formulation with O ( n 2 ) variables for quadratic assignment problems with Manhattan distance matrices
inferred← citeshttps://doi.org/10.1016/0167-188x(89)90063-3openalex-snapshot
Successive approximations procedures for a cellular manufacturing problem with machine loading constraints
inferred← citeshttps://doi.org/10.1016/0377-2217(94)00257-6openalex-snapshot
A decision model for interdependent information system project selection
inferred← citeshttps://doi.org/10.1016/0898-1221(91)90164-yopenalex-snapshot
An algorithm for indefinite integer quadratic programming
inferred← citeshttps://doi.org/10.1016/j.cor.2022.106072openalex-snapshot
Modified Modularity Density Maximization and Density Ratio Heuristic
inferred← citeshttps://doi.org/10.1016/j.cor.2023.106158openalex-snapshot
Shortest paths with exclusive-disjunction arc pairs conflicts
inferred← citeshttps://doi.org/10.1016/j.cor.2023.106515openalex-snapshot
New optimization models for optimal classification trees
inferred← citeshttps://doi.org/10.1016/j.dam.2007.08.035openalex-snapshot
A network approach for specially structured linear programs arising in 0–1 quadratic optimization
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.dam.2014.05.009openalex-snapshot
Maximum probability shortest path problem
inferred← citeshttps://doi.org/10.1016/j.dam.2020.04.004openalex-snapshot
Matroid optimization problems with monotone monomials in the objective
inferred← citeshttps://doi.org/10.1016/j.disopt.2014.07.002openalex-snapshot
A new separation algorithm for the Boolean quadric and cut polytopes
inferred← citeshttps://doi.org/10.1016/j.disopt.2016.05.003openalex-snapshot
Improved compact formulations for a wide class of graph partitioning problems in sparse graphs
inferred← citeshttps://doi.org/10.1016/j.disopt.2017.02.001openalex-snapshot
A class of valid inequalities for multilinear 0–1 optimization problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2015.02.044openalex-snapshot
The Steiner travelling salesman problem with correlated costs
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.ejor.2020.02.019openalex-snapshot
Product assortment and space allocation strategies to attract loyal and non-loyal customers
inferred← citeshttps://doi.org/10.1016/j.ejor.2020.10.047openalex-snapshot
Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2024.12.032openalex-snapshot
The quadratic knapsack problem
inferred← citeshttps://doi.org/10.1016/j.epsr.2024.110798openalex-snapshot
Optimal price menu design of electric vehicle charging stations providing demand response
inferred← citeshttps://doi.org/10.1016/j.eswa.2023.121954openalex-snapshot
Generating collective counterfactual explanations in score-based classification via mathematical optimization
inferred← citeshttps://doi.org/10.1016/j.orl.2013.08.008openalex-snapshot
A completely positive representation of 0–1 linear programs with joint probabilistic constraints
inferred← citeshttps://doi.org/10.1016/j.orl.2017.10.007openalex-snapshot
A note on representations of linear inequalities in non-convex mixed-integer quadratic programs
inferred← citeshttps://doi.org/10.1016/j.orl.2018.08.005openalex-snapshot
A binarisation heuristic for non-convex quadratic programming with box constraints
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(99)00116-xopenalex-snapshot
Best second order bounds for two-terminal network reliability with dependent edge failures
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70343-1openalex-snapshot
Methods of Nonlinear 0-1 Programming
inferred← citeshttps://doi.org/10.1051/ro:2008011openalex-snapshot
Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations
inferred← citeshttps://doi.org/10.1057/jors.2014.73openalex-snapshot
The school class allocation problem—maximising friendship requests subject to diversity requirements
inferred← citeshttps://doi.org/10.1080/00207543.2023.2180307openalex-snapshot
On solving the cross-dock door assignment problem
inferred← citeshttps://doi.org/10.1080/10556788.2016.1230209openalex-snapshot
Improved linearized models for graph partitioning problem under capacity constraints
inferred← citeshttps://doi.org/10.1103/physreve.82.046112openalex-snapshot
Column generation algorithms for exact modularity maximization in networks
inferred← citeshttps://doi.org/10.1108/jhlscm-03-2024-0043openalex-snapshot
Medical staff planning for field hospital deployments: the START hospital
inferred← citeshttps://doi.org/10.1109/access.2019.2955477openalex-snapshot
An Efficient Building Evacuation Algorithm in Congested Networks
inferred← citeshttps://doi.org/10.1109/cec.2014.6900337openalex-snapshot
A memetic algorithm for the prize-collecting Traveling Car Renter Problem
inferred← citeshttps://doi.org/10.1109/date.2007.364649openalex-snapshot
Automatic Test Pattern Generation for Maximal Circuit Noise in Multiple Aggressor Crosstalk Faults
inferred← citeshttps://doi.org/10.1109/iccd.2004.1347951openalex-snapshot
Circuit-based preprocessing of ILP and its applications in leakage minimization and power estimation
inferred← citeshttps://doi.org/10.1109/icmsao.2013.6552725openalex-snapshot
A multi-period supply chain design with product life cycle considerations
inferred← citeshttps://doi.org/10.1109/icnsc.2013.6548850openalex-snapshot
A supply chain design with product life cycle and green procurement considerations
inferred← citeshttps://doi.org/10.1109/smartgridcomm.2014.7007740openalex-snapshot
Minimizing commercial building cost in Smart Grid: An optimal meeting scheduling approach
inferred← citeshttps://doi.org/10.1109/tcad.2010.2043589openalex-snapshot
On ATPG for Multiple Aggressor Crosstalk Faults
inferred← citeshttps://doi.org/10.1109/test.2007.4437563openalex-snapshot
On ATPG for multiple aggressor crosstalk faults in presence of gate delays
inferred← citeshttps://doi.org/10.1109/tmm.2012.2236304openalex-snapshot
A Differential Coding-Based Scheduling Framework for Wireless Multimedia Sensor Networks
inferred← citeshttps://doi.org/10.1109/tpds.2025.3527649openalex-snapshot
Chasing Common Knowledge: Joint Large Model Selection and Pulling in MEC With Parameter Sharing
inferred← citeshttps://doi.org/10.1109/tpds.2026.3728847openalex-snapshot
Collaborative Large Model Caching and Inference Offloading With Parameter Sharing in MEC
inferred← citeshttps://doi.org/10.1109/tvlsi.2011.2106169openalex-snapshot
Test Pattern Generation for Multiple Aggressor Crosstalk Effects Considering Gate Leakage Loading in Presence of Gate Delays
inferred← citeshttps://doi.org/10.1109/vlsi.design.2009.10openalex-snapshot
An ILP Based ATPG Technique for Multiple Aggressor Crosstalk Faults Considering the Effects of Gate Delays
inferred← citeshttps://doi.org/10.1111/itor.70237openalex-snapshot
The quadratic bin packing problem: exact formulations and algorithms
inferred← citeshttps://doi.org/10.1137/16m1091162openalex-snapshot
Mixed-Integer Programming for Cycle Detection in Nonreversible Markov Processes
inferred← citeshttps://doi.org/10.1137/20m1318523openalex-snapshot
Tight Cycle Relaxations for the Cut Polytope
inferred← citeshttps://doi.org/10.1145/2939672.2939879openalex-snapshot
Optimally Discriminative Choice Sets in Discrete Choice Models
inferred← citeshttps://doi.org/10.1145/3631908.3631929openalex-snapshot
On Optimal QUBO Encoding of Boolean Logic, (Max-)3-SAT and (Max-)k-SAT with Integer Programming
inferred← citeshttps://doi.org/10.1287/ijoc.14.4.295.2828openalex-snapshot
Logic, Optimization, and Constraint Programming
inferred← citeshttps://doi.org/10.1287/mnsc.32.10.1274openalex-snapshot
A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
inferred← citeshttps://doi.org/10.1287/msom.2017.0626openalex-snapshot
Managing Reliability and Stability Risks in Forest Harvesting
inferred← citeshttps://doi.org/10.1287/opre.2024.1415openalex-snapshot
Community-Oriented Market Design for Nonprofit Resource Exchange
inferred← citeshttps://doi.org/10.1287/opre.40.1.s109openalex-snapshot
A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems
inferred← citeshttps://doi.org/10.1590/s0101-74382009000300002openalex-snapshot
A branch-and-cut SDP-based algorithm for minimum sum-of-squares clustering
inferred← citeshttps://doi.org/10.17615/k256-xr13openalex-snapshot
Continuous Optimization Methods for the Quadratic Assignment Problem
inferred← citeshttps://doi.org/10.23952/asvao.5.2023.2.08openalex-snapshot
Stable-set and coloring bounds based on 0-1 quadratic optimization
inferred← citeshttps://doi.org/10.3390/math8111986openalex-snapshot
Facilities Delocation in the Retail Sector: A Mixed 0-1 Nonlinear Optimization Model and Its Linear Reformulation
inferred← citeshttps://doi.org/10.4236/ijcns.2012.54026openalex-snapshot
Improved Balas and Mazzola Linearization for Quadratic 0-1 Programs with Application in a New CuttingPlane Algorithm
inferred← citeshttps://doi.org/10.48550/arxiv.1204.4562openalex-snapshot
A Tight Linearization Strategy for Zero-One Quadratic Programming Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1310.0395openalex-snapshot
Protein Threading Based on Nonlinear Integer Programming
inferred← citeshttps://doi.org/10.48550/arxiv.2005.07030openalex-snapshot
A Polynomial-Time Algorithm for Unconstrained Binary Quadratic Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.2011.08823openalex-snapshot
Compact mixed-integer programming relaxations in quadratic optimization
inferred← citeshttps://doi.org/10.5539/jmr.v11n1p42openalex-snapshot
A Dichotomic Algorithm for Transportation Network and Land Use Problem
inferred← citeshttps://doi.org/10.5802/ojmo.34openalex-snapshot
Short Paper - The Binary Linearization Complexity of Pseudo-Boolean Functions
inferred← citeshttps://doi.org/10.70675/e4d7bf05z2521z420fzb97dz518a0cf9382copenalex-snapshot
Méthodes d'optimisation combinatoire en programmation mathématique : Application à la conception des systèmes de verger-maraîcher
inferred← citeshttps://doi.org/10.7282/t3pz5bhqopenalex-snapshot
Algorithmic and complexity results for boolean and pseudo-boolean functions
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.