On the public citation graph

Generalized Weighted Mean Programming

0 signed · 46 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/978-3-642-64971-4openalex-snapshot
Inequalities
inferredcites →https://doi.org/10.1007/bf01876939openalex-snapshot
Condensing generalized polynomials
inferredcites →https://doi.org/10.1063/1.1730947openalex-snapshot
Variational Principles for Chemical Equilibrium
inferredcites →https://doi.org/10.1063/1.1744264openalex-snapshot
Chemical Equilibrium in Complex Mixtures
inferredcites →https://doi.org/10.1093/comjnl/12.3.207-aopenalex-snapshot
Nonlinear Programming--Sequential Unconstrained Minimization Techniques
inferredcites →https://doi.org/10.1137/0115117openalex-snapshot
Generalized Polynomial Optimization
inferredcites →https://doi.org/10.1137/0116030openalex-snapshot
A Geometric Programming Algorithm for Solving Chemical Equilibrium Problems
inferredcites →https://doi.org/10.1137/0119011openalex-snapshot
Complementary Geometric Programming
inferredcites →https://doi.org/10.1137/1012043openalex-snapshot
Linearizing Geometric Programs

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.1620090112openalex-snapshot
Solution of generalized geometric programs
inferred← citeshttps://doi.org/10.1002/nme.1620310706openalex-snapshot
A monomial‐based method for solving systems of non‐linear algebraic equations
inferred← citeshttps://doi.org/10.1002/nme.1620371206openalex-snapshot
The monomial method: Extensions, variations, and performance issues
inferred← citeshttps://doi.org/10.1002/nme.1620372211openalex-snapshot
The monomial method and asymptotic properties of algebraic systems
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_220openalex-snapshot
Geometric Programming
inferred← citeshttps://doi.org/10.1007/978-1-4615-8285-4_11openalex-snapshot
Solution of Generalized Geometric Programs
inferred← citeshttps://doi.org/10.1007/978-1-4615-8285-4_14openalex-snapshot
Comparison of Generalized Geometric Programming Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4615-8285-4_23openalex-snapshot
Bibliographical Note on Geometric Programming
inferred← citeshttps://doi.org/10.1007/bf01580373openalex-snapshot
A condensation method for generalized geometric programming
inferred← citeshttps://doi.org/10.1007/bf01876939openalex-snapshot
Condensing generalized polynomials
inferred← citeshttps://doi.org/10.1007/s10898-012-9933-0openalex-snapshot
Branch-reduction-bound algorithm for generalized geometric programming
inferred← citeshttps://doi.org/10.1016/j.amc.2003.12.101openalex-snapshot
Linearization method of global optimization for generalized geometric programming
inferred← citeshttps://doi.org/10.1016/j.amc.2005.01.142openalex-snapshot
A deterministic global optimization algorithm for generalized geometric programming
inferred← citeshttps://doi.org/10.1016/j.amc.2006.05.208openalex-snapshot
A new global optimization algorithm for signomial geometric programming via Lagrangian relaxation
inferred← citeshttps://doi.org/10.1016/j.camwa.2004.07.008openalex-snapshot
Global optimization of generalized geometric programming
inferred← citeshttps://doi.org/10.1016/j.cnsns.2012.07.016openalex-snapshot
Solving a class of geometric programming problems by an efficient dynamic model
inferred← citeshttps://doi.org/10.1016/j.ejor.2005.11.037openalex-snapshot
On generalized geometric programming problems with non-positive variables
inferred← citeshttps://doi.org/10.1016/j.ejor.2007.06.034openalex-snapshot
A global optimization using linear relaxation for generalized geometric programming
inferred← citeshttps://doi.org/10.1016/j.ejor.2011.06.046openalex-snapshot
Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems
inferred← citeshttps://doi.org/10.1016/s0096-3003(03)00200-5openalex-snapshot
Global optimization of signomial geometric programming using linear relaxation
inferred← citeshttps://doi.org/10.1016/s0377-2217(96)00265-2openalex-snapshot
Investigation of path-following algorithms for signomial geometric programming problems
inferred← citeshttps://doi.org/10.1016/s0895-7177(02)00080-8openalex-snapshot
A new type of condensation curvilinear path algorithm for unconstrained generalized geometric programming
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/05695557308974889openalex-snapshot
Geometric Programming: A Technical State-of-the-Art Survey
inferred← citeshttps://doi.org/10.1108/02644409710188628openalex-snapshot
An alternative linearization technique
inferred← citeshttps://doi.org/10.1109/cpsna.2013.6614251openalex-snapshot
Stochastic online sensor scheduler for remote state estimation
inferred← citeshttps://doi.org/10.1109/iciecs.2009.5365116openalex-snapshot
A Branch and Bound Algorithm for Generalized Polynomial Programming Problems
inferred← citeshttps://doi.org/10.1137/1022058openalex-snapshot
Geometric Programming: Methods, Computations and Applications
inferred← citeshttps://doi.org/10.1145/1068009.1068062openalex-snapshot
Artificial immune system for solving generalized geometric problems
inferred← citeshttps://doi.org/10.1155/2014/163263openalex-snapshot
A Global Optimization Algorithm for Signomial Geometric Programming Problem
inferred← citeshttps://doi.org/10.1186/s13660-018-1947-9openalex-snapshot
Inner approximation algorithm for generalized linear multiplicative programming problems
inferred← citeshttps://doi.org/10.1287/ijoc.1100.0403openalex-snapshot
An Efficient Global Approach for Posynomial Geometric Programming Problems
inferred← citeshttps://doi.org/10.13140/rg.2.1.3130.1289openalex-snapshot
MODELIZACIÓN Y RESOLUCIÓN DE PROBLEMAS DE OPTIMIZACIÓN EN ECONOMÍA
inferred← citeshttps://doi.org/10.1512/iumj.1973.22.22045openalex-snapshot
Reversed Geometric Programs Treated by Harmonic Means
inferred← citeshttps://doi.org/10.1515/9783110883237.3347openalex-snapshot
A monomial-based version of Newton's method
inferred← citeshttps://doi.org/10.20965/jaciii.2007.p0358openalex-snapshot
Real-Coded Genetic Algorithm for Solving Generalized Polynomial Programming Problems
inferred← citeshttps://doi.org/10.3934/jimo.2012.8.429openalex-snapshot
An efficient convexification method for solving generalized geometric problems
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.