On the public citation graph

A polynomially bounded algorithm for a singly constrained quadratic program

https://doi.org/10.1007/bf01588328
0 signed · 123 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.1007/bf01580223openalex-snapshot
Validation of subgradient optimization
inferredcites →https://doi.org/10.1287/mnsc.23.9.994openalex-snapshot
An Effective Subgradient Procedure for Minimal Cost Multicommodity Flow Problems
inferredcites →https://doi.org/10.1287/mnsc.5.1.44openalex-snapshot
The Theory of Search: Optimum Distribution of Search Effort
inferredcites →https://doi.org/10.1287/opre.11.2.265openalex-snapshot
A Problem in Optimum Allocation
inferredcites →https://doi.org/10.1287/opre.19.7.1647openalex-snapshot
On an Allocation Problem with Multistage Constraints
inferredcites →https://doi.org/10.1287/opre.23.2.360openalex-snapshot
Technical Note—Allocation of Effort Resources among Competing Activities
inferredcites →https://doi.org/10.1287/opre.28.4.995openalex-snapshot
Technical Note—Computational Comparison among Three Multicommodity Network Flow Algorithms

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.10089openalex-snapshot
A specially structured nonlinear integer resource allocation problem
inferred← citeshttps://doi.org/10.1002/nav.21483openalex-snapshot
Mixed integer least squares optimization for flight and maintenance planning of mission aircraft
inferred← citeshttps://doi.org/10.1002/nav.3800330106openalex-snapshot
A lagrangean relaxation algorithm for the constrained matrix problem
inferred← citeshttps://doi.org/10.1002/net.3230210407openalex-snapshot
Computational development of a lagrangian dual approach for quadratic networks
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_65openalex-snapshot
Complexity Theory: Quadratic Programming
inferred← citeshttps://doi.org/10.1007/1-4020-0611-x_501openalex-snapshot
Knapsack problems with nonlinearities
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_81openalex-snapshot
Complexity Theory: Quadratic Programming
inferred← citeshttps://doi.org/10.1007/978-1-4419-1153-7_501openalex-snapshot
Knapsack Problems with Nonlinearities
inferred← citeshttps://doi.org/10.1007/978-1-4613-3400-2_6openalex-snapshot
Parallel Algorithms for Network Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-46548-2_6openalex-snapshot
A Dual Conjugate Gradient Method for the Single-Commodity Spatial Price Equilibrium Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-59179-2_9openalex-snapshot
Distributed Disaggregate Simplicial Decomposition — A Parallel Algorithm for Traffic Assignment
inferred← citeshttps://doi.org/10.1007/978-3-642-61370-8_19openalex-snapshot
A Note About Peojections in the Implementation of Stochastic Quasigradient Methods
inferred← citeshttps://doi.org/10.1007/bf00248762openalex-snapshot
Application of the dual active set algorithm to quadratic network optimization
inferred← citeshttps://doi.org/10.1007/bf00940516openalex-snapshot
AnO(n 2) active set method for solving a certain parametric quadratic program
inferred← citeshttps://doi.org/10.1007/bf01396045openalex-snapshot
Algorithms for bound constrained quadratic programming problems
inferred← citeshttps://doi.org/10.1007/bf01449044openalex-snapshot
Projections onto order simplexes
inferred← citeshttps://doi.org/10.1007/bf01581085openalex-snapshot
Approximation algorithms for indefinite quadratic programming
inferred← citeshttps://doi.org/10.1007/bf01581193openalex-snapshot
On the continuous quadratic knapsack problem
inferred← citeshttps://doi.org/10.1007/bf01585740openalex-snapshot
Towards a strongly polynomial algorithm for strictly convex quadratic programs: An extension of Tardos' algorithm
inferred← citeshttps://doi.org/10.1007/bf01585748openalex-snapshot
An algorithm for a singly constrained class of quadratic programs subject to upper and lower bounds
inferred← citeshttps://doi.org/10.1007/bf01586048openalex-snapshot
Local minima for indefinite quadratic knapsack problems
inferred← citeshttps://doi.org/10.1007/bf01588800openalex-snapshot
On the solution of concave knapsack problems
inferred← citeshttps://doi.org/10.1007/bf02591992openalex-snapshot
Convex quadratic programming with one constraint and bounded variables
inferred← citeshttps://doi.org/10.1007/bf02943605openalex-snapshot
Efficient minimization over products of simplices and its application to nonlinear multicommodity network problems
inferred← citeshttps://doi.org/10.1007/bf03398839openalex-snapshot
A relaxed projection method for general integer quadratic knapsack problem
inferred← citeshttps://doi.org/10.1007/bfb0000037openalex-snapshot
Optimality conditions in nonlinear programming
inferred← citeshttps://doi.org/10.1007/s00186-017-0585-1openalex-snapshot
An optimal subgradient algorithm for large-scale bound-constrained convex optimization
inferred← citeshttps://doi.org/10.1007/s10107-005-0595-2openalex-snapshot
New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
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-015-0918-xopenalex-snapshot
An efficient global algorithm for a class of indefinite separable quadratic programs
inferred← citeshttps://doi.org/10.1007/s10589-006-0396-4openalex-snapshot
Convex programming with single separable constraint and bounded variables
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-019-00748-3openalex-snapshot
Minimum variance allocation among constrained intervals
inferred← citeshttps://doi.org/10.1007/s10915-021-01541-9openalex-snapshot
An Efficient Hessian Based Algorithm for Singly Linearly and Box Constrained Least Squares Regression
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/s11081-005-6796-yopenalex-snapshot
A Class of Mathematical Programs with Equilibrium Constraints: A Smooth Algorithm and Applications to Contact Problems
inferred← citeshttps://doi.org/10.1007/s11590-011-0288-0openalex-snapshot
A breakpoint search approach for convex resource allocation problems with bounded variables
inferred← citeshttps://doi.org/10.1007/s12351-015-0205-xopenalex-snapshot
Convex optimization problems in supply chain planning and their solution by a column generation method based on the Frank Wolfe method
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/s13226-020-0445-1openalex-snapshot
The Geometric Properties of a Class of Nonsymmetric Cones
inferred← citeshttps://doi.org/10.1016/0167-6377(84)90010-5openalex-snapshot
An O(n) algorithm for quadratic knapsack problems
inferred← citeshttps://doi.org/10.1016/0167-6377(90)90067-fopenalex-snapshot
On a discrete nonlinear and nonseparable knapsack problem
inferred← citeshttps://doi.org/10.1016/0377-2217(84)90160-7openalex-snapshot
A polynomial algorithm for minimum quadratic cost flow problems
inferred← citeshttps://doi.org/10.1016/0377-2217(85)90316-9openalex-snapshot
The stochastic linear continuous type knapsack problem: A generalized P model
inferred← citeshttps://doi.org/10.1016/0377-2217(94)00302-5openalex-snapshot
Capacity planning in manufacturing and computer networks
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.ejor.2005.02.029openalex-snapshot
Issues in the implementation of the DSD algorithm for the traffic assignment problem
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.2007.06.005openalex-snapshot
Convergent Lagrangian heuristics for nonlinear minimum cost network flows
inferred← citeshttps://doi.org/10.1016/j.ejor.2008.12.012openalex-snapshot
Decision model and analysis for investment interest expense deduction and allocation
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.2015.06.014openalex-snapshot
On the solution of multidimensional convex separable continuous knapsack problem with bounded variables
inferred← citeshttps://doi.org/10.1016/j.eswa.2014.09.006openalex-snapshot
An improved genetic algorithm based approach to solve constrained knapsack problem in fuzzy environment
inferred← citeshttps://doi.org/10.1016/j.jcp.2011.03.017openalex-snapshot
Formulation, analysis and numerical study of an optimization-based conservative interpolation (remap) of scalar fields for arbitrary Lagrangian–Eulerian methods
inferred← citeshttps://doi.org/10.1016/j.orl.2013.01.014openalex-snapshot
Finding the projection onto the intersection of a closed half-space and a variable box
inferred← citeshttps://doi.org/10.1016/j.orl.2014.07.001openalex-snapshot
Solving the continuous nonlinear resource allocation problem with an interior point method
inferred← citeshttps://doi.org/10.1016/j.orl.2021.08.014openalex-snapshot
On the long-only minimum variance portfolio under single factor model
inferred← citeshttps://doi.org/10.1016/j.spa.2020.07.006openalex-snapshot
Minimizing a stochastic convex function subject to stochastic constraints and some applications
inferred← citeshttps://doi.org/10.1016/j.trc.2008.10.002openalex-snapshot
Store-and-forward based methods for the signal control problem in large-scale congested urban road networks
inferred← citeshttps://doi.org/10.1016/j.trc.2021.103412openalex-snapshot
Decentralized store-and-forward based strategies for the signal control problem in large-scale congested urban road networks
inferred← citeshttps://doi.org/10.1016/j.trc.2024.104863openalex-snapshot
Feedback–feedforward signal control with exogenous demand estimation in congested urban road networks
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/s0305-0548(00)00089-7openalex-snapshot
A pegging algorithm for the nonlinear resource allocation problem
inferred← citeshttps://doi.org/10.1016/s0377-2217(01)00179-5openalex-snapshot
The nonlinear knapsack problem – algorithms and applications
inferred← citeshttps://doi.org/10.1016/s0377-2217(97)00048-9openalex-snapshot
A dual ascent method for the portfolio selection problem with multiple constraints and linked proposals
inferred← citeshttps://doi.org/10.1016/s0377-2217(98)00180-5openalex-snapshot
Nonlinear integer programming for optimal allocation in stratified sampling
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80122-7openalex-snapshot
Chapter 5 Parallel computing in network optimization
inferred← citeshttps://doi.org/10.1023/a:1008739510750openalex-snapshot
Convex Separable Minimization Subject to Bounded Variables
inferred← citeshttps://doi.org/10.1051/ro/1986200100011openalex-snapshot
Répartition optimale de la puissance dans une centrale hydraulique à réserve pompée
inferred← citeshttps://doi.org/10.1051/ro/2018036openalex-snapshot
Undecidability and hardness in mixed-integer nonlinear programming
inferred← citeshttps://doi.org/10.1057/jors.1990.121openalex-snapshot
A Parallel Projection for the Multicommodity Network Model
inferred← citeshttps://doi.org/10.1057/jors.1996.44openalex-snapshot
A Projection Method for the Integer Quadratic Knapsack Problem
inferred← citeshttps://doi.org/10.1080/02331934.2021.1958810openalex-snapshot
Efficient projection onto the intersection of a half-space and a box-like set and its generalized Jacobian
inferred← citeshttps://doi.org/10.1080/02522667.2019.1624048openalex-snapshot
Characterization of the optimal solution of the convex separable continuous knapsack problem and related problems
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/09720502.2006.10700438openalex-snapshot
Minimizing a convex separable exponential function subject to linear equality constraint and bounded variables
inferred← citeshttps://doi.org/10.1080/09720502.2009.10700652openalex-snapshot
Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints
inferred← citeshttps://doi.org/10.1080/09720502.2010.10700719openalex-snapshot
Solution of some convex separable resource allocation and production planning problems with bounds on the variables
inferred← citeshttps://doi.org/10.1080/09720510.2017.1417730openalex-snapshot
Strictly convex separable optimization with linear equality constraints and bounded variables
inferred← citeshttps://doi.org/10.1080/15472450500183722openalex-snapshot
Application and Evaluation of the Signal Traffic Control Strategy TUC in Chania
inferred← citeshttps://doi.org/10.1109/cdc.1989.70310openalex-snapshot
Algorithms for quadratic transportation networks
inferred← citeshttps://doi.org/10.1109/globalsip.2014.7032205openalex-snapshot
Matrix optimization for poisson compressed sensing
inferred← citeshttps://doi.org/10.1109/itsc55140.2022.9922508openalex-snapshot
SAFFRON: Store-And-Forward model toolbox For urban ROad Network signal control in MATLAB
inferred← citeshttps://doi.org/10.1109/scp.2015.7342137openalex-snapshot
Orthogonal projection of a point onto the standard simplex algorithms analysis
inferred← citeshttps://doi.org/10.1109/tits.2011.2116156openalex-snapshot
A Hybrid Strategy for Real-Time Traffic Signal Control of Urban Road Networks
inferred← citeshttps://doi.org/10.1109/tnsm.2019.2907526openalex-snapshot
Cooperative Data Sharing for Mobile Cloudlets Under Heterogeneous Environments
inferred← citeshttps://doi.org/10.1109/tsp.2022.3221837openalex-snapshot
An Efficient Algorithm for a Class of Large-Scale Support Vector Machines Exploiting Hidden Sparsity
inferred← citeshttps://doi.org/10.1134/s1990478916020137openalex-snapshot
Comparative study of two fast algorithms for projecting a point to the standard simplex
inferred← citeshttps://doi.org/10.1134/s1990478918020126openalex-snapshot
Complexity Estimation for an Algorithm of Searching for Zero of a Piecewise Linear Convex Function
inferred← citeshttps://doi.org/10.1137/0325023openalex-snapshot
Iterative Methods for Large Convex Quadratic Programs: A Survey
inferred← citeshttps://doi.org/10.1137/0328011openalex-snapshot
Dual Ascent Methods for Problems with Strictly Convex Costs and Linear Constraints: A Unified Approach
inferred← citeshttps://doi.org/10.1137/110827144openalex-snapshot
On the Moreau--Yosida Regularization of the Vector $k$-Norm Related Functions
inferred← citeshttps://doi.org/10.1142/s0217595910002594openalex-snapshot
IMPROVED PROJECTED GRADIENT ALGORITHMS FOR SINGLY LINEARLY CONSTRAINED QUADRATIC PROGRAMS SUBJECT TO LOWER AND UPPER BOUNDS
inferred← citeshttps://doi.org/10.1142/s0217595921500202openalex-snapshot
B-Subdifferentials of the Projection onto the Generalized Simplex
inferred← citeshttps://doi.org/10.1145/2160158.2160160openalex-snapshot
The notion of a rational convex program, and an algorithm for the arrow-debreu Nash bargaining game
inferred← citeshttps://doi.org/10.1145/2828635openalex-snapshot
An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem
inferred← citeshttps://doi.org/10.1145/96559.96597openalex-snapshot
Convex separable optimization is not much harder than linear optimization
inferred← citeshttps://doi.org/10.1155/amrx/2006/36581openalex-snapshot
Minimization of a convex linear-fractional separable function subject to a convex inequality constraint or linear inequality constraint and bounds on the variables
inferred← citeshttps://doi.org/10.1155/ijmms.2005.1339openalex-snapshot
Convex separable minimization problems with a linearconstraint and bounded variables
inferred← citeshttps://doi.org/10.1155/jamds/2006/89307openalex-snapshot
An efficient method for minimizing a convex separable logarithmic function subject to a convex inequality constraint or linear equality constraint
inferred← citeshttps://doi.org/10.1155/s168712000402009xopenalex-snapshot
inferred← citeshttps://doi.org/10.1287/ijoc.2023.1282openalex-snapshot
Convex and Nonconvex Risk-Based Linear Regression at Scale
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/opre.43.4.670openalex-snapshot
The Nonlinear Resource Allocation Problem
inferred← citeshttps://doi.org/10.1287/trsc.23.2.118openalex-snapshot
Supply and Demand Equilibration Algorithms for a Class of Market Equilibrium Problems
inferred← citeshttps://doi.org/10.13140/2.1.3071.3120openalex-snapshot
Convex Cost Multicommodity Flow Problems: Applications and Algorithms
inferred← citeshttps://doi.org/10.1609/aaai.v31i1.10795openalex-snapshot
An Exact Penalty Method for Binary Optimization Based on MPEC Formulation
inferred← citeshttps://doi.org/10.3156/jsoft.16.153openalex-snapshot
A Study on Continuous Linear Knapsack Problems with Fuzzy Random Variable Coefficients
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.1608.04425openalex-snapshot
Binary Optimization via Mathematical Programming with Equilibrium Constraints
inferred← citeshttps://doi.org/10.48550/arxiv.1608.04430openalex-snapshot
Sparsity Constrained Minimization via Mathematical Programming with Equilibrium Constraints
inferred← citeshttps://doi.org/10.48550/arxiv.2001.03766openalex-snapshot
A Two-Phase Method for Solving Continuous Rank-One Quadratic Knapsack Problems
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.5555/2095116.2095194openalex-snapshot
The notion of a rational convex program, and an algorithm for the Arrow-Debreu Nash bargaining game
inferred← citeshttps://doi.org/10.70675/f46d3ab0z654cz4883za8b9z874478bb6b85openalex-snapshot
Méthodes d'Optimisation et de Théorie des Jeux Appliquées aux Systèmes Électriques Décentralisés
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.