On the public citation graph

Relaxation-based algorithms for minimax optimization problems with resource allocation applications

https://doi.org/10.1007/bf01582580
0 signed · 50 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.1002/1520-6750(198808)35:4<493::aid-nav3220350405>3.0.co;2-0openalex-snapshot
Multiperiod allocation of limited resources: A minimax approach
inferredcites →https://doi.org/10.1002/1520-6750(198906)36:3<311::aid-nav3220360308>3.0.co;2-lopenalex-snapshot
A mofified gub algorithm for solving linear minimax problems
inferredcites →https://doi.org/10.1002/j.1538-7305.1989.tb00323.xopenalex-snapshot
Allocation of Scarce Resources in Manufacturing Facilities
inferredcites →https://doi.org/10.1007/bf01581200openalex-snapshot
A lexicographic minimax algorithm for multiperiod resource allocation
inferredcites →https://doi.org/10.1007/bf01582227openalex-snapshot
Bounded knapsack sharing
inferredcites →https://doi.org/10.1007/bf01584333openalex-snapshot
New algorithms for constrained minimax optimization
inferredcites →https://doi.org/10.1007/bf01586926openalex-snapshot
Solving knapsack sharing problems with general tradeoff functions
inferredcites →https://doi.org/10.1007/bf01588966openalex-snapshot
Linearly constrained minimax optimization
inferredcites →https://doi.org/10.1007/bf01589343openalex-snapshot
Linear max-min programming
inferredcites →https://doi.org/10.1007/bf01933625openalex-snapshot
Max-min resource allocation
inferredcites →https://doi.org/10.1007/bf02288321openalex-snapshot
A computational comparison of the dinic and network simplex methods for maximum flow
inferredcites →https://doi.org/10.1007/bf02591994openalex-snapshot
Continuous maximin knapsack problems with GLB constraints
inferredcites →https://doi.org/10.1016/0024-3795(89)90488-6openalex-snapshot
Representation of general and polyhedral subsemilattices and sublattices of product spaces
inferredcites →https://doi.org/10.1016/0167-6377(85)90017-3openalex-snapshot
Minimax linear programming problem
inferredcites →https://doi.org/10.1016/0167-6377(86)90012-xopenalex-snapshot
Resource allocation among competing activities: a lexicographic minimax approach
inferredcites →https://doi.org/10.1016/0167-6377(87)90013-7openalex-snapshot
An algorithm for separable non-linear minimax problems
inferredcites →https://doi.org/10.1016/0167-6377(91)90057-vopenalex-snapshot
A nonlinear minimax allocation problem with multiple knapsack constraints
inferredcites →https://doi.org/10.1016/0167-6377(91)90082-zopenalex-snapshot
A linear-time algorithm for solving continuous maximin knapsack problems
inferredcites →https://doi.org/10.1016/0377-2217(82)90110-2openalex-snapshot
An algorithm for solving linearly constrained minimax problems
inferredcites →https://doi.org/10.1016/0377-2217(84)90087-0openalex-snapshot
Methods of the allocation of limited resources
inferredcites →https://doi.org/10.1016/0377-2217(86)90187-6openalex-snapshot
A graphical method to solve a maximin allocation problem
inferredcites →https://doi.org/10.1016/0377-2217(89)90387-1openalex-snapshot
A min-max resource allocation problem with substitutions
inferredcites →https://doi.org/10.1016/0377-2217(89)90502-xopenalex-snapshot
Fortran codes for network optimization
inferredcites →https://doi.org/10.1016/0377-2217(92)90335-7openalex-snapshot
Minimax resource allocation problems: Optimization and parametric analysis
inferredcites →https://doi.org/10.1057/jors.1989.116openalex-snapshot
Resource Allocation Problems: Algorithmic Approaches
inferredcites →https://doi.org/10.1080/00401706.1971.10488852openalex-snapshot
Allocation of Total Sample Size When Only the Stratum Means Are of Interest
inferredcites →https://doi.org/10.1137/s0097539793251876openalex-snapshot
Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
inferredcites →https://doi.org/10.1287/mnsc.39.8.964openalex-snapshot
A Multiperiod Minimax Resource Allocation Problem with Substitutable Resources
inferredcites →https://doi.org/10.1287/opre.22.4.802openalex-snapshot
Application of Programs with Maximin Objective Functions to Problems of Optimal Resource Allocation
inferredcites →https://doi.org/10.1287/opre.27.2.341openalex-snapshot
The Knapsack Sharing Problem
inferredcites →https://doi.org/10.1287/opre.32.5.1087openalex-snapshot
The Linear Sharing Problem
inferredcites →https://doi.org/10.1287/opre.36.2.359openalex-snapshot
A Max-Min Allocation Problem: Its Solutions and Applications
inferredcites →https://doi.org/10.1287/opre.39.2.285openalex-snapshot
Minimax Resource Allocation with Tree Structured Substitutable Resources
inferredcites →https://doi.org/10.1287/opre.41.5.959openalex-snapshot
Minimax Resource Allocation Problems with Resource-Substitutions Represented by Graphs
inferredcites →https://doi.org/10.2307/3008975openalex-snapshot
Linear and Combinatorial Programming

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9781118449189.refsopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1002/nav.20109openalex-snapshot
Allocation of resources of modular sizes with an application to Internet Protocol (IP) address allocation
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_44openalex-snapshot
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/s10479-022-05114-3openalex-snapshot
Allocation of limited resources under quadratic constraints
inferred← citeshttps://doi.org/10.1016/0377-2217(94)00035-bopenalex-snapshot
Multiperiod allocation of substitutable resources
inferred← citeshttps://doi.org/10.1016/j.advengsoft.2004.10.001openalex-snapshot
Optimizing financial budget for software implementation based on the development effort and cost function
inferred← citeshttps://doi.org/10.1023/a:1016775215940openalex-snapshot
A Resource Allocation Approach for the Generation of Service-Dependent Demand Matrices for Communications Networks
inferred← citeshttps://doi.org/10.1109/tce.2025.3587176openalex-snapshot
QoS-Enabled Wireless Split Federated Learning: A Reinforcement Learning and Optimization Approach
inferred← citeshttps://doi.org/10.1287/msom.2022.0550openalex-snapshot
Stochastic Resource Allocation Problems: Minmax and Maxmin Solutions
inferred← citeshttps://doi.org/10.1287/opre.47.3.361openalex-snapshot
On Equitable Resource Allocation Problems: A Lexicographic Minimax Approach
inferred← citeshttps://doi.org/10.1287/opre.49.6.913.10023openalex-snapshot
A Min-Max-Sum Resource Allocation Problem and Its Applications
inferred← citeshttps://doi.org/10.1504/ejie.2007.012655openalex-snapshot
Scalable material assignment methods for build-to-order environments
inferred← citeshttps://doi.org/10.1504/ijor.2016.073958openalex-snapshot
Lexicographic multi-period resources allocation problem with weighted substitutable resources
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.