On the public citation graph
On the supermodular knapsack problem
0 signed · 61 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/9781118445112.stat02287openalex-snapshot
Mathematical Programming
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2openalex-snapshot
Complexity of Computer Computations
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-642-85823-9openalex-snapshot
Boolean Methods in Operations Research and Related Areas
inferredcites →https://doi.org/10.1007/978-3-642-97881-4openalex-snapshot
Geometric Algorithms and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/bf01588971openalex-snapshot
An analysis of approximations for maximizing submodular set functions—I
inferredcites →https://doi.org/10.1007/bf02579273openalex-snapshot
The ellipsoid method and its consequences in combinatorial optimization
inferredcites →https://doi.org/10.1016/0166-218x(85)90035-6openalex-snapshot
Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions
inferredcites →https://doi.org/10.1016/0305-0548(93)90042-hopenalex-snapshot
Nonlinear programming: theory and algorithms
inferredcites →https://doi.org/10.1016/s0167-5060(08)70043-8openalex-snapshot
Quasimonotone Boolean Functions and Bistellar Graphs
inferredcites →https://doi.org/10.1057/jors.1979.231openalex-snapshot
Nonlinear Programming -- Theory and Algorithms
inferredcites →https://doi.org/10.1145/12130.12144openalex-snapshot
A new approach to the maximum flow problem
inferredcites →https://doi.org/10.1287/opre.26.2.305openalex-snapshot
Minimizing a Submodular Function on a Lattice
inferredcites →https://doi.org/10.6028/nbs.ir.75-737openalex-snapshot
Mathematical methods of site selection for electronic message systems (EMS)
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4939-0742-7_2openalex-snapshot
A Polynomial Algorithm for a Class of 0–1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering
inferred← citeshttps://doi.org/10.1007/978-3-540-85958-1_8openalex-snapshot
Classes of Submodular Constraints Expressible by Graph Cuts
inferred← citeshttps://doi.org/10.1007/978-3-642-03816-7_63openalex-snapshot
The Expressive Power of Binary Submodular Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-33974-5_4openalex-snapshot
Expressibility of Submodular Languages
inferred← citeshttps://doi.org/10.1007/bf01587085openalex-snapshot
Recognition problems for special classes of polynomials in 0–1 variables
inferred← citeshttps://doi.org/10.1007/bf02032129openalex-snapshot
On some large-scale LP relaxations for the Graph Partitioning Problem and their optimal solutions
inferred← citeshttps://doi.org/10.1007/bf02032163openalex-snapshot
Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems
inferred← citeshttps://doi.org/10.1007/s10479-015-2018-yopenalex-snapshot
Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications
inferred← citeshttps://doi.org/10.1007/s10601-009-9078-zopenalex-snapshot
Classes of submodular constraints expressible by graph cuts
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/s10898-012-9872-9openalex-snapshot
On reduction of duality gap in quadratic knapsack problems
inferred← citeshttps://doi.org/10.1007/s10957-011-9885-4openalex-snapshot
Global Optimality Conditions and Optimization Methods for Quadratic Knapsack Problems
inferred← citeshttps://doi.org/10.1007/s11741-007-0308-zopenalex-snapshot
A branch-and-bound algorithm for multi-dimensional quadratic 0–1 knapsack problems
inferred← citeshttps://doi.org/10.1007/s40314-024-02951-9openalex-snapshot
Efficient random walks for generating random fuzzy measures in Möbius representation in large universe
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)00286-xopenalex-snapshot
Lagrangean methods for the 0–1 Quadratic Knapsack Problem
inferred← citeshttps://doi.org/10.1016/0377-2217(94)90122-8openalex-snapshot
A column generation approach to job grouping for flexible manufacturing systems
inferred← citeshttps://doi.org/10.1016/j.dam.2009.07.001openalex-snapshot
The expressive power of binary submodular functions
inferred← citeshttps://doi.org/10.1016/j.dam.2016.11.022openalex-snapshot
Efficient minimization of higher order submodular functions using monotonic Boolean functions
inferred← citeshttps://doi.org/10.1016/j.disopt.2009.03.002openalex-snapshot
The submodular knapsack polytope
inferred← citeshttps://doi.org/10.1016/j.ejor.2021.11.004openalex-snapshot
Knapsack problems with dependencies through non-additive measures and Choquet integral
inferred← citeshttps://doi.org/10.1016/j.ejor.2024.12.019openalex-snapshot
A fast and effective breakpoints heuristic algorithm for the quadratic knapsack problem
inferred← citeshttps://doi.org/10.1016/j.jpdc.2015.04.004openalex-snapshot
Decentralised dispatch of distributed energy resources in smart grids via multi-agent coalition formation
inferred← citeshttps://doi.org/10.1016/j.jpdc.2018.07.006openalex-snapshot
An agent-based service adaptation approach in distributed multi-tenant service-based systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.11.009openalex-snapshot
Approximability issues for unconstrained and constrained maximization of half-product related functions
inferred← citeshttps://doi.org/10.1016/j.tre.2009.12.004openalex-snapshot
A three-level supply chain network design model with risk-pooling and lead times
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00341-9openalex-snapshot
Pseudo-Boolean optimization
inferred← citeshttps://doi.org/10.1016/s0167-6377(02)00122-0openalex-snapshot
The quadratic 0–1 knapsack problem with series–parallel support
inferred← citeshttps://doi.org/10.1016/s0377-2217(96)00388-8openalex-snapshot
Combinatorial optimization models for production scheduling in automated manufacturing systems
inferred← citeshttps://doi.org/10.1080/03155986.1998.11732364openalex-snapshot
A Bibliographical Survey On Some Well-Known Non-Standard Knapsack Problems
inferred← citeshttps://doi.org/10.1080/10556788.2011.627586openalex-snapshot
A note on semidefinite relaxation for 0-1 quadratic knapsack problems
inferred← citeshttps://doi.org/10.1109/cvpr.2008.4587401openalex-snapshot
Exact inference in multi-label CRFs with higher order cliques
inferred← citeshttps://doi.org/10.1109/tcns.2016.2548424openalex-snapshot
Gramian-Based Reachability Metrics for Bilinear Networks
inferred← citeshttps://doi.org/10.1109/ths.2012.6459864openalex-snapshot
Partial cuts in attack graphs for cost effective network defence
inferred← citeshttps://doi.org/10.1111/itor.12414openalex-snapshot
Heuristic and exact algorithms for product configuration in software product lines
inferred← citeshttps://doi.org/10.1145/1963405.1963499openalex-snapshot
Limiting the spread of misinformation in social networks
inferred← citeshttps://doi.org/10.1287/mnsc.41.4.669openalex-snapshot
Single-Facility Resource Allocation Under Capacity-Based Economies and Diseconomies of Scope
inferred← citeshttps://doi.org/10.1287/moor.2014.0657openalex-snapshot
Polynomially Computable Bounds for the Probability of the Union of Events
inferred← citeshttps://doi.org/10.1287/msom.2021.1023openalex-snapshot
Urban Bike Lane Planning with Bike Trajectories: Models, Algorithms, and a Real-World Case Study
inferred← citeshttps://doi.org/10.15421/40290420openalex-snapshot
Формалізація постановок задач про укладання туристичного ранця та алгоритми їх розв'язання
inferred← citeshttps://doi.org/10.1613/jair.5023openalex-snapshot
Quadratization and Roof Duality of Markov Logic Networks
inferred← citeshttps://doi.org/10.2514/1.i010656openalex-snapshot
Dynamic Scheduling Algorithm for Data Relay Services in Next-Generation TDRS Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1404.6538openalex-snapshot
On Quadratization of Pseudo-Boolean Functions
inferred← citeshttps://doi.org/10.48550/arxiv.2008.09645openalex-snapshot
Urban Bike Lane Planning with Bike Trajectories: Models, Algorithms, and a Real-World Case Study
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.