On the public citation graph
Condensing generalized polynomials
0 signed · 33 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.1021/i260022a018openalex-snapshot
Optimal Condenser Design by Geometric Programming
inferredcites →https://doi.org/10.1137/0108011openalex-snapshot
The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
inferredcites →https://doi.org/10.1137/0108053openalex-snapshot
The Cutting-Plane Method for Solving Convex Programs
inferredcites →https://doi.org/10.1137/0120075openalex-snapshot
Generalized Weighted Mean Programming
inferredcites →https://doi.org/10.1287/mnsc.5.1.38openalex-snapshot
A Linear Programming Approach to the Chemical Equilibrium Problem
inferredcites →https://doi.org/10.1287/opre.18.3.441openalex-snapshot
Modular Design: An Application of Structured Geometric 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/nme.1620371206openalex-snapshot
The monomial method: Extensions, variations, and performance issues
inferred← citeshttps://doi.org/10.1007/978-1-4615-8285-4_18openalex-snapshot
Global Solutions of Mathematical Programs with Intrinsically Concave Functions
inferred← citeshttps://doi.org/10.1007/978-1-4615-8285-4_22openalex-snapshot
Optimal Design of a Dry-Type Natural-Draft Cooling Tower by Geometric Programming
inferred← citeshttps://doi.org/10.1007/978-1-4615-8285-4_23openalex-snapshot
Bibliographical Note on Geometric Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-82450-0_5openalex-snapshot
Reflections on Geometric Programming
inferred← citeshttps://doi.org/10.1007/bf00933273openalex-snapshot
Global solutions of mathematical programs with intrinsically concave functions
inferred← citeshttps://doi.org/10.1007/bf00933410openalex-snapshot
Optimal design of a dry-type natural-draft cooling tower by geometric programming
inferred← citeshttps://doi.org/10.1007/bf00934095openalex-snapshot
A computational study of methods for solving polynomial geometric programs
inferred← citeshttps://doi.org/10.1007/bf00934288openalex-snapshot
Geometric programming with signomials
inferred← citeshttps://doi.org/10.1007/bf01580373openalex-snapshot
A condensation method for generalized geometric programming
inferred← citeshttps://doi.org/10.1007/bfb0121227openalex-snapshot
A theoretical model for the determination of the optimal design of a power transportation and distribution system with several voltage levels
inferred← citeshttps://doi.org/10.1016/0307-904x(86)90041-7openalex-snapshot
Optimizing the number of tools and cutting parameters in multi-tool turning for multiple objectives through geometric programming
inferred← citeshttps://doi.org/10.1016/s0895-7177(00)00060-1openalex-snapshot
A new algorithm for geometric programming based on the linear structure of its dual problem
inferred← citeshttps://doi.org/10.1023/b:coap.0000004981.17496.9copenalex-snapshot
A General Alternative Procedure for Solving Negative Degree of Difficulty Problems in Geometric Programming
inferred← citeshttps://doi.org/10.1080/00207727408920166openalex-snapshot
The dual of the dual as an approximation of the primal
inferred← citeshttps://doi.org/10.1080/02533839.1983.9676755openalex-snapshot
Generalized geometric programming with both equality and inequality constraints
inferred← citeshttps://doi.org/10.1080/03052157908902411openalex-snapshot
AN ALGORITHM FOR OPTIMIZING NONLINEAR CONSTRAINED ZERO-ONE PROBLEMS TO IMPROVE WASTEWATER TREATMENT
inferred← citeshttps://doi.org/10.1080/05695557308974876openalex-snapshot
Geometric Programming with Slack Constraints and Degrees of Difficulty
inferred← citeshttps://doi.org/10.1080/05695557308974889openalex-snapshot
Geometric Programming: A Technical State-of-the-Art Survey
inferred← citeshttps://doi.org/10.1080/05695557408974942openalex-snapshot
Sensitivity Analysis in Generalized Polynomial Programming
inferred← citeshttps://doi.org/10.1137/0120075openalex-snapshot
Generalized Weighted Mean Programming
inferred← citeshttps://doi.org/10.1287/opre.34.3.345openalex-snapshot
OR Practice—Solving Complex Chemical Equilibria Using a Geometric-Programming Based Technique
inferred← citeshttps://doi.org/10.1512/iumj.1973.22.22045openalex-snapshot
Reversed Geometric Programs Treated by Harmonic Means
inferred← citeshttps://doi.org/10.7166/2-2-444openalex-snapshot
AN ALGORITHM TO MINIMIZE SINGLE VARIABLE POLYNOMIAL, FUNCTIONS FROM ANY STARTING POINT WITH QUADRATIC CONVERGENCE
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.