On the public citation graph
About strongly polynomial time algorithms for quadratic optimization over submodular constraints
0 signed · 106 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/9781118627372openalex-snapshot
Integer and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/bf01580862openalex-snapshot
Some proximity and sensitivity results in quadratic integer programming
inferredcites →https://doi.org/10.1007/bf01581207openalex-snapshot
A polynomial algorithm for an integer quadratic non-separable transportation problem
inferredcites →https://doi.org/10.1007/bf01581240openalex-snapshot
A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series—parallel networks
inferredcites →https://doi.org/10.1007/bf01582230openalex-snapshot
Sensitivity theorems in integer linear programming
inferredcites →https://doi.org/10.1016/0022-0000(82)90048-4openalex-snapshot
The complexity of selection and ranking in X + Y and matrices with sorted columns
inferredcites →https://doi.org/10.1016/0022-0000(85)90014-5openalex-snapshot
A linear-time algorithm for a special case of disjoint set union
inferredcites →https://doi.org/10.1016/0166-218x(90)90098-wopenalex-snapshot
On an optimization problem with nested constraints
inferredcites →https://doi.org/10.1016/0167-6377(84)90010-5openalex-snapshot
An O(n) algorithm for quadratic knapsack problems
inferredcites →https://doi.org/10.1016/0167-6377(93)90041-eopenalex-snapshot
Linear time algorithms for some separable quadratic programming problems
inferredcites →https://doi.org/10.1016/s0022-0000(73)80033-9openalex-snapshot
Time bounds for selection
inferredcites →https://doi.org/10.1016/s0167-5060(05)x8001-3openalex-snapshot
Submodular Functions and Optimization
inferredcites →https://doi.org/10.1057/jors.1989.116openalex-snapshot
Resource Allocation Problems: Algorithmic Approaches
inferredcites →https://doi.org/10.1109/59.65909openalex-snapshot
Efficient integer optimization algorithms for optimal coordination of capacitors and regulators
inferredcites →https://doi.org/10.1137/0218003openalex-snapshot
A Fast Parametric Maximum Flow Algorithm and Applications
inferredcites →https://doi.org/10.1145/12130.12144openalex-snapshot
A new approach to the maximum flow problem
inferredcites →https://doi.org/10.1145/48014.61051openalex-snapshot
A new approach to the maximum-flow problem
inferredcites →https://doi.org/10.1145/96559.96597openalex-snapshot
Convex separable optimization is not much harder than linear optimization
inferredcites →https://doi.org/10.1287/moor.19.1.94openalex-snapshot
Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources
inferredcites →https://doi.org/10.1287/moor.19.2.390openalex-snapshot
Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems
inferredcites →https://doi.org/10.1287/moor.5.2.186openalex-snapshot
Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector
inferredcites →https://doi.org/10.1287/opre.34.2.250openalex-snapshot
A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
inferredcites →https://doi.org/10.2307/2583737openalex-snapshot
Integer and Combinatorial Optimization
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/nav.21740openalex-snapshot
Determining optimal sizes of bounded batches with rejection via quadratic min-cost flow
inferred← citeshttps://doi.org/10.1002/net.1012openalex-snapshot
A new—old algorithm for minimum‐cut and maximum‐flow in closure graphs
inferred← citeshttps://doi.org/10.1002/net.1030openalex-snapshot
Universally maximum flow with piecewise‐constant capacities
inferred← citeshttps://doi.org/10.1002/net.20040openalex-snapshot
A network flow approach to cost allocation for rooted trees
inferred← citeshttps://doi.org/10.1002/net.21587openalex-snapshot
Timing problems and algorithms: Time decisions for sequences of activities
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_56openalex-snapshot
Combinatorial Optimization Algorithms in Resource Allocation Problems
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_14openalex-snapshot
Resource Allocation Problems
inferred← citeshttps://doi.org/10.1007/978-1-4614-6624-6_44-1openalex-snapshot
Resource Allocation Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-27195-4_23openalex-snapshot
Maximize a Monotone Function with a Generic Submodularity Ratio
inferred← citeshttps://doi.org/10.1007/978-3-030-41672-0_10openalex-snapshot
A Survey on Double Greedy Algorithms for Maximizing Non-monotone Submodular Functions
inferred← citeshttps://doi.org/10.1007/978-3-319-39574-6_19openalex-snapshot
Scheduling with Maintenance and Linear Cumulative Effects
inferred← citeshttps://doi.org/10.1007/978-3-540-76796-1_7openalex-snapshot
Theory of Principal Partitions Revisited
inferred← citeshttps://doi.org/10.1007/s00291-017-0474-2openalex-snapshot
Resource allocation problems in decentralized energy management
inferred← citeshttps://doi.org/10.1007/s10107-006-0050-zopenalex-snapshot
Breakpoint searching algorithms for the continuous quadratic knapsack problem
inferred← citeshttps://doi.org/10.1007/s10107-009-0274-9openalex-snapshot
A class of nonlinear nonseparable continuous knapsack and multiple-choice knapsack problems
inferred← citeshttps://doi.org/10.1007/s10107-021-01711-5openalex-snapshot
Decreasing minimization on M-convex sets: algorithms and applications
inferred← citeshttps://doi.org/10.1007/s10107-021-01722-2openalex-snapshot
Decreasing minimization on M-convex sets: background and structures
inferred← citeshttps://doi.org/10.1007/s10288-005-0078-6openalex-snapshot
Complexity and algorithms for convex network optimization and other nonlinear problems
inferred← citeshttps://doi.org/10.1007/s10479-007-0172-6openalex-snapshot
Complexity and algorithms for nonlinear optimization problems
inferred← citeshttps://doi.org/10.1007/s10589-016-9863-8openalex-snapshot
Fast algorithm for singly linearly constrained quadratic programs with box-like constraints
inferred← citeshttps://doi.org/10.1007/s10898-018-0686-2openalex-snapshot
Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost
inferred← citeshttps://doi.org/10.1007/s10951-009-0117-9openalex-snapshot
Inverse scheduling with maximum lateness objective
inferred← citeshttps://doi.org/10.1007/s10951-010-0168-yopenalex-snapshot
Inverse scheduling: two-machine flow-shop problem
inferred← citeshttps://doi.org/10.1007/s10951-012-0287-8openalex-snapshot
Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance
inferred← citeshttps://doi.org/10.1007/s10957-007-9317-7openalex-snapshot
Variable Fixing Algorithms for the Continuous Quadratic Knapsack Problem
inferred← citeshttps://doi.org/10.1007/s12532-014-0066-yopenalex-snapshot
A Newton’s method for the continuous quadratic knapsack problem
inferred← citeshttps://doi.org/10.1007/s13160-022-00511-4openalex-snapshot
Decreasing minimization on base-polyhedra: relation between discrete and continuous cases
inferred← citeshttps://doi.org/10.1016/j.aam.2003.11.001openalex-snapshot
Quadratic M-convex and L-convex functions
inferred← citeshttps://doi.org/10.1016/j.apm.2011.10.017openalex-snapshot
Simple solution methods for separable mixed linear and quadratic knapsack problem
inferred← citeshttps://doi.org/10.1016/j.cor.2021.105451openalex-snapshot
A fast algorithm for quadratic resource allocation problems with nested constraints
inferred← citeshttps://doi.org/10.1016/j.dam.2007.02.003openalex-snapshot
A survey of scheduling with controllable processing times
inferred← citeshttps://doi.org/10.1016/j.disopt.2006.10.010openalex-snapshot
Two-machine open shop problem with controllable processing times
inferred← citeshttps://doi.org/10.1016/j.ejor.2006.12.006openalex-snapshot
A survey on the continuous nonlinear resource allocation problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2015.01.029openalex-snapshot
Algorithms for the continuous nonlinear resource allocation problem—New implementations and numerical studies
inferred← citeshttps://doi.org/10.1016/j.ejor.2017.08.034openalex-snapshot
Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: A review of solution approaches
inferred← citeshttps://doi.org/10.1016/j.ejor.2018.04.013openalex-snapshot
Approximation schemes for non-separable non-linear boolean programming problems under nested knapsack constraints
inferred← citeshttps://doi.org/10.1016/j.ejor.2018.05.015openalex-snapshot
The newsvendor problem with capacitated suppliers and quantity discounts
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.05.018openalex-snapshot
Maximize a monotone function with a generic submodularity ratio
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.08.011openalex-snapshot
A fast algorithm for maximizing a non-monotone DR-submodular integer lattice function
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.08.012openalex-snapshot
Deterministic approximation algorithm for submodular maximization subject to a matroid constraint
inferred← citeshttps://doi.org/10.1016/s0167-6377(96)00039-9openalex-snapshot
Quadratic resource allocation with generalized upper bounds
inferred← citeshttps://doi.org/10.1016/s0377-2217(01)00179-5openalex-snapshot
The nonlinear knapsack problem – algorithms and applications
inferred← citeshttps://doi.org/10.1080/00949659808811906openalex-snapshot
Maximum likelihood estimation of cell probabilities in constrained multinomial models
inferred← citeshttps://doi.org/10.1080/01605682.2026.2724047openalex-snapshot
Reverse scheduling on a single machine with adjustable release and processing times: optimal algorithms and applications
inferred← citeshttps://doi.org/10.1109/energycon.2016.7514033openalex-snapshot
Considering grid limitations in profile steering
inferred← citeshttps://doi.org/10.1137/080736156openalex-snapshot
M-Convex Function Minimization by Continuous Relaxation Approach: Proximity Theorem and Algorithm
inferred← citeshttps://doi.org/10.1137/140965119openalex-snapshot
A Decomposition Algorithm for Nested Resource Allocation Problems
inferred← citeshttps://doi.org/10.1137/140978296openalex-snapshot
A Strongly Polynomial Algorithm for a Class of Minimum-Cost Flow Problems with Separable Convex Objectives
inferred← citeshttps://doi.org/10.1142/s0129054109006541openalex-snapshot
SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES BY SUBMODULAR OPTIMIZATION
inferred← citeshttps://doi.org/10.1145/2213977.2213981openalex-snapshot
Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives
inferred← citeshttps://doi.org/10.1145/237814.237978openalex-snapshot
Fast algorithms for parametric scheduling come from extensions to parametric maximum flow
inferred← citeshttps://doi.org/10.1145/2828635openalex-snapshot
An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem
inferred← citeshttps://doi.org/10.1287/ijoc.2017.0758openalex-snapshot
Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints
inferred← citeshttps://doi.org/10.1287/ijoc.2021.1104openalex-snapshot
On a Reduction for a Class of Resource Allocation Problems
inferred← citeshttps://doi.org/10.1287/ijoo.2021.0065openalex-snapshot
A Class of Convex Quadratic Nonseparable Resource Allocation Problems with Generalized Bound Constraints
inferred← citeshttps://doi.org/10.1287/mnsc.2016.2461openalex-snapshot
Redesigning Benders Decomposition for Large-Scale Facility Location
inferred← citeshttps://doi.org/10.1287/moor.19.2.390openalex-snapshot
Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems
inferred← citeshttps://doi.org/10.1287/opre.1110.1000openalex-snapshot
Polymatroid Optimization, Submodularity, and Joint Replenishment Games
inferred← citeshttps://doi.org/10.1287/opre.43.4.670openalex-snapshot
The Nonlinear Resource Allocation Problem
inferred← citeshttps://doi.org/10.1287/opre.47.5.744openalex-snapshot
Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow
inferred← citeshttps://doi.org/10.1561/2200000039openalex-snapshot
Learning with Submodular Functions: A Convex Optimization Perspective
inferred← citeshttps://doi.org/10.1561/9781601987570openalex-snapshot
Learning with Submodular Functions: A Convex Optimization Perspective
inferred← citeshttps://doi.org/10.15807/jorsj.40.565openalex-snapshot
CHARACTERIZING A VALUATED DELTA-MATROID AS A FAMILY OF DELTA-MATROIDS*
inferred← citeshttps://doi.org/10.1609/aaai.v29i1.9477openalex-snapshot
Stable Feature Selection from Brain sMRI
inferred← citeshttps://doi.org/10.3390/en9080594openalex-snapshot
Robust Peak-Shaving for a Neighborhood with Electric Vehicles
inferred← citeshttps://doi.org/10.3934/naco.2021048openalex-snapshot
Variable fixing method by weighted average for the continuous quadratic knapsack problem
inferred← citeshttps://doi.org/10.3990/1.9789036551618openalex-snapshot
Duality-driven optimization in energy management: offline and online algorithms for resource allocation problems
inferred← citeshttps://doi.org/10.48550/arxiv.1008.5209openalex-snapshot
Network Flow Algorithms for Structured Sparsity
inferred← citeshttps://doi.org/10.48550/arxiv.1010.4207openalex-snapshot
Convex Analysis and Optimization with Submodular Functions: a Tutorial
inferred← citeshttps://doi.org/10.48550/arxiv.1104.1872openalex-snapshot
Convex and Network Flow Optimization for Structured Sparsity
inferred← citeshttps://doi.org/10.48550/arxiv.1110.4882openalex-snapshot
Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives
inferred← citeshttps://doi.org/10.48550/arxiv.1311.4296openalex-snapshot
Reflection methods for user-friendly submodular optimization
inferred← citeshttps://doi.org/10.48550/arxiv.1404.6694openalex-snapshot
A Decomposition Algorithm for Nested Resource Allocation Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1503.01563openalex-snapshot
Convex Optimization for Parallel Energy Minimization
inferred← citeshttps://doi.org/10.48550/arxiv.1712.06199openalex-snapshot
Structured Optimal Transport
inferred← citeshttps://doi.org/10.48550/arxiv.1808.07600openalex-snapshot
Discrete Decreasing Minimization, Part I: Base-polyhedra with Applications in Network Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.1808.08477openalex-snapshot
Discrete Decreasing Minimization, Part II: Views from Discrete Convex Analysis
inferred← citeshttps://doi.org/10.48550/arxiv.2008.09838openalex-snapshot
ODDO: Online Duality-Driven Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.2102.12094openalex-snapshot
Combinatorial Pure Exploration with Bottleneck Reward Function
inferred← citeshttps://doi.org/10.5281/zenodo.169850openalex-snapshot
FIGURES 16–17. Puliciphora females, abdominal tergites 4–6 in Rudimentary halteres of some flightless female Phoridae (Diptera) reassessed, and some taxonomic implications
inferred← citeshttps://doi.org/10.70675/05f9e61fz96d1z44c9z8d2czb309e3460ba1openalex-snapshot
On the Links between Probabilistic Graphical Models and Submodular Optimisation
inferred← citeshttps://doi.org/10.70675/72faf70fze619z44adzb071z7e7ca54a5a67openalex-snapshot
Sparse coding for machine learning, image processing and computer vision
inferred← citeshttps://doi.org/10.7936/k7610xjsopenalex-snapshot
A Duality Theory with Zero Duality Gap for Nonlinear Programming
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.