On the public citation graph

Computing a global optimal solution to a design centering problem

https://doi.org/10.1007/bf01585697
0 signed · 43 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-45610-7_3openalex-snapshot
Generalized Differentiability / Duality and Optimization for Problems Dealing with Differences of Convex Functions
inferredcites →https://doi.org/10.1007/bf00939828openalex-snapshot
Optimal coverage of convex regions
inferredcites →https://doi.org/10.1007/bf01442898openalex-snapshot
Linear programs with an additional reverse convex constraint
inferredcites →https://doi.org/10.1007/bf01580765openalex-snapshot
The design centering problem as a D.C. programming problem
inferredcites →https://doi.org/10.1016/s0304-0208(08)72403-4openalex-snapshot
A General Deterministic Approach to Global Optimization VIA D.C. Programming
inferredcites →https://doi.org/10.1016/s0304-0208(08)x7126-9openalex-snapshot
Fermat Days 85: Mathematics for Optimization
inferredcites →https://doi.org/10.1109/tcad.1982.1269992openalex-snapshot
A Design Centering Algorithm for Nonconvex Regions of Acceptability
inferredcites →https://doi.org/10.1109/tcs.1985.1085675openalex-snapshot
A new global optimization method for electronic circuit design
inferredcites →https://doi.org/10.1515/9781400873173openalex-snapshot
Convex Analysis

What points at this work

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

inferred← citeshttps://doi.org/10.1007/0-387-34221-4_10openalex-snapshot
A semi-infinite approach to design centering
inferred← citeshttps://doi.org/10.1007/978-1-4613-0301-5_1openalex-snapshot
Global Optimization Methods for Location and Distance Geometry Problems
inferred← citeshttps://doi.org/10.1007/978-1-4613-3437-8_26openalex-snapshot
A General D.C. Approach to Location Problems
inferred← citeshttps://doi.org/10.1007/978-1-4615-2025-2_4openalex-snapshot
D.C. Optimization: Theory, Methods and Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4757-3403-4_6openalex-snapshot
On Convex Lower Level Problems in Generalized Semi-Infinite Optimization
inferred← citeshttps://doi.org/10.1007/978-3-031-16224-4_2openalex-snapshot
Recent Advances in Sphere Packing Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-57592-1_27openalex-snapshot
The Feasible Set in Generalized Semi-Infinite Optimization
inferred← citeshttps://doi.org/10.1007/bf00119991openalex-snapshot
On solving a D.C. programming problem by a sequence of linear programs
inferred← citeshttps://doi.org/10.1007/bf01106607openalex-snapshot
A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem
inferred← citeshttps://doi.org/10.1007/bf02578994openalex-snapshot
On generalized semi-infinite programming
inferred← citeshttps://doi.org/10.1007/s00186-017-0591-3openalex-snapshot
How to solve a design centering problem
inferred← citeshttps://doi.org/10.1007/s10107-012-0556-5openalex-snapshot
The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets
inferred← citeshttps://doi.org/10.1007/s10589-015-9729-5openalex-snapshot
A collision detection approach for maximizing the material utilization
inferred← citeshttps://doi.org/10.1007/s10957-025-02807-0openalex-snapshot
A Global Approach for Generalized Semi-Infinite Programs with Polyhedral Parameter Sets
inferred← citeshttps://doi.org/10.1007/s12065-020-00542-1openalex-snapshot
A novel algorithm for efficient utilization of gemstone using genetic algorithm
inferred← citeshttps://doi.org/10.1016/j.cam.2007.02.012openalex-snapshot
Generalized semi-infinite programming: A tutorial
inferred← citeshttps://doi.org/10.1016/j.cor.2021.105290openalex-snapshot
Extracting maximal objects from three-dimensional solid materials
inferred← citeshttps://doi.org/10.1016/j.ejco.2021.100006openalex-snapshot
Recent advances in nonconvex semi-infinite programming: Applications and algorithms
inferred← citeshttps://doi.org/10.1016/j.ejor.2007.01.057openalex-snapshot
Application of general semi-infinite programming to lapidary cutting problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2012.06.009openalex-snapshot
How to solve a semi-infinite optimization problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2024.05.048openalex-snapshot
Efficient use of collision detection for volume maximization problems
inferred← citeshttps://doi.org/10.1016/s0096-3003(02)00417-4openalex-snapshot
Applications of interval arithmetic in non-smooth global optimization
inferred← citeshttps://doi.org/10.1021/acs.iecr.5c04321openalex-snapshot
Design Centering via Bayesian Optimization for Robust Operation of Chemical Processes
inferred← citeshttps://doi.org/10.1023/a:1013051931073openalex-snapshot
inferred← citeshttps://doi.org/10.1023/a:1021765131316openalex-snapshot
DC Programming: Overview
inferred← citeshttps://doi.org/10.1049/iet-cta.2013.0607openalex-snapshot
Skewed structured singular value‐based approach for the construction of design spaces: theory and applications
inferred← citeshttps://doi.org/10.1051/ro/1991250201831openalex-snapshot
Un algorithme pour la résolution du programme linéaire général
inferred← citeshttps://doi.org/10.1109/clei.2012.6427153openalex-snapshot
A real-valued genetic algorithm for gemstone cutting
inferred← citeshttps://doi.org/10.1137/060657741openalex-snapshot
The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
inferred← citeshttps://doi.org/10.1137/s0363012901398393openalex-snapshot
Solving Semi-Infinite Optimization Problems with Interior Point Techniques
inferred← citeshttps://doi.org/10.1287/moor.26.3.565.10583openalex-snapshot
First-Order Optimality Conditions for Degenerate Index Sets in Generalized Semi-Infinite Optimization
inferred← citeshttps://doi.org/10.21638/11701/spbu31.2021.07openalex-snapshot
Multi-objective Optimization Approach to Malfatti's Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1909.05516openalex-snapshot
Inverse Graphical Method for Global Optimization and Application to Design Centering Problem
inferred← citeshttps://doi.org/10.5564/mmj.v26i24.3001openalex-snapshot
Optimal Control Sphere Packing Problem
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.