On the public citation graph

Matroid optimisation problems with nested non-linear monomials in the objective function

https://doi.org/10.1007/s10107-017-1140-9
0 signed · 41 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jctb.2000.1989openalex-snapshot
A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
inferredcites →https://doi.org/10.1007/3-540-36478-1_2openalex-snapshot
Submodular Functions, Matroids, and Certain Polyhedra
inferredcites →https://doi.org/10.1007/978-1-4757-4388-3openalex-snapshot
A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems
inferredcites →https://doi.org/10.1007/978-3-642-78240-4openalex-snapshot
Geometric Algorithms and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/bf01584082openalex-snapshot
Matroids and the greedy algorithm
inferredcites →https://doi.org/10.1007/bf01589101openalex-snapshot
The boolean quadric polytope: Some characteristics, facets and relatives
inferredcites →https://doi.org/10.1007/bf03006558openalex-snapshot
L’algebre de Boole et ses applications en recherche operationnelle
inferredcites →https://doi.org/10.1016/0166-218x(92)00190-wopenalex-snapshot
A hierarchy of relaxations and convex hull characterizations for mixed-integer zero—one programming problems
inferredcites →https://doi.org/10.1016/j.dam.2014.05.031openalex-snapshot
Combinatorial optimization with one quadratic term: Spanning trees and forests
inferredcites →https://doi.org/10.1016/j.disopt.2015.10.002openalex-snapshot
An exact solution method for quadratic matching: The one-quadratic-term technique and generalisations
inferredcites →https://doi.org/10.1016/j.disopt.2017.02.001openalex-snapshot
A class of valid inequalities for multilinear 0–1 optimization problems
inferredcites →https://doi.org/10.1016/j.orl.2013.09.011openalex-snapshot
Complete description for the spanning tree problem with one linearised quadratic term
inferredcites →https://doi.org/10.1016/s0167-5060(05)x8001-3openalex-snapshot
Submodular Functions and Optimization
inferredcites →https://doi.org/10.1016/s0898-1221(99)91233-6openalex-snapshot
A reformulation-linearization technique for solving discrete and continuous nonconvex problems
inferredcites →https://doi.org/10.1016/s0927-0507(05)12007-6openalex-snapshot
Submodular Function Minimization
inferredcites →https://doi.org/10.1017/s000497270004140xopenalex-snapshot
Comments on bases in dependence structures
inferredcites →https://doi.org/10.1080/03155986.2004.11732696openalex-snapshot
On The Boolean Quadric Forest Polytope
inferredcites →https://doi.org/10.1137/0403036openalex-snapshot
A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
inferredcites →https://doi.org/10.1137/050646500openalex-snapshot
Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case
inferredcites →https://doi.org/10.1137/070696465openalex-snapshot
Nonlinear Matroid Optimization and Experimental Design
inferredcites →https://doi.org/10.1137/16m1089691openalex-snapshot
Complete Description of Matching Polytopes with One Linearized Quadratic Term for Bipartite Graphs
inferredcites →https://doi.org/10.1137/s0895480102408559openalex-snapshot
Convex Matroid Optimization
inferredcites →https://doi.org/10.1145/1498698.1658383openalex-snapshot
Computation in multicriteria matroid optimization
inferredcites →https://doi.org/10.1287/moor.2016.0804openalex-snapshot
A Polyhedral Study of Binary Polynomial Programs
inferredcites →https://doi.org/10.1287/opre.21.1.156openalex-snapshot
Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
inferredcites →https://doi.org/10.1287/opre.22.1.180openalex-snapshot
Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
inferredcites →https://doi.org/10.17877/de290r-7050openalex-snapshot
Combinatorial optimization with one quadratic term
inferredcites →https://doi.org/10.6028/jres.071b.032openalex-snapshot
Optimum branchings

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.4530363openalex-extracted
Solving Unconstrained Binary Polynomial Programs with Limited Reach
inferred← citeshttps://doi.org/10.1007/978-3-030-53262-8_5openalex-snapshot
Cardinality Constrained 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/s10878-025-01334-yopenalex-snapshot
Quadratization and convexification in polynomial binary optimization
inferred← citeshttps://doi.org/10.1016/j.cor.2024.106586openalex-snapshot
Solving unconstrained binary polynomial programs with limited reach: Application to low autocorrelation binary sequences
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.dam.2022.09.010openalex-snapshot
Multilinear sets with two monomials and cardinality constraints
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.disopt.2023.100804openalex-snapshot
Convexifying multilinear sets with cardinality constraints: Structural properties, nested case and extensions
inferred← citeshttps://doi.org/10.1016/j.ejor.2018.07.045openalex-snapshot
Berge-acyclic multilinear 0–1 optimization problems
inferred← citeshttps://doi.org/10.1137/16m1089691openalex-snapshot
Complete Description of Matching Polytopes with One Linearized Quadratic Term for Bipartite Graphs
inferred← citeshttps://doi.org/10.1287/opre.2022.0489openalex-snapshot
Drone-Delivery Network for Opioid Overdose: Nonlinear Integer Queueing-Optimization Models and Methods
inferred← citeshttps://doi.org/10.48550/arxiv.2012.06394openalex-snapshot
Polyhedral Analysis of Symmetric Multilinear Polynomials over Box Constraints
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.