On the public citation graph

Parallel computing in nonconvex programming

https://doi.org/10.1007/bf02024487

0 signed · 42 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(199008)37:4<499::aid-nav3220370405>3.0.co;2-9openalex-snapshot

Guaranteed ε-approximate solution for indefinite quadratic global minimization

inferredcites →https://doi.org/10.1002/cnm.1630020305openalex-snapshot

Numerical algorithms on the crystal multicomputer

inferredcites →https://doi.org/10.1002/net.3230010205openalex-snapshot

Minimum cost routing for static network models

inferredcites →https://doi.org/10.1002/net.3230090202openalex-snapshot

Adjacent extreme flows and application to min concave cost flow problems

inferredcites →https://doi.org/10.1007/3-540-50871-6openalex-snapshot

Global Optimization

inferredcites →https://doi.org/10.1007/3-540-53032-0openalex-snapshot

A Collection of Test Problems for Constrained Global Optimization Algorithms

inferredcites →https://doi.org/10.1007/978-1-4612-5022-7openalex-snapshot

Numerical Optimization Techniques

inferredcites →https://doi.org/10.1007/978-3-662-02598-7openalex-snapshot

Global Optimization

inferredcites →https://doi.org/10.1007/bf00130828openalex-snapshot

Global search algorithms for minimum concave-cost network flow problems

inferredcites →https://doi.org/10.1007/bf01585724openalex-snapshot

Concurrent stochastic methods for global optimization

inferredcites →https://doi.org/10.1007/bf01637663openalex-snapshot

A comparative study of primal and dual approaches for solving separable and partially-separable nonlinear optimization problems

inferredcites →https://doi.org/10.1007/bf02186475openalex-snapshot

A parallel algorithm for solving the linear complementarity problem

inferredcites →https://doi.org/10.1007/bf02283683openalex-snapshot

Preface

inferredcites →https://doi.org/10.1007/bf02283688openalex-snapshot

Minimum concave-cost network flow problems: Applications, complexity, and algorithms

inferredcites →https://doi.org/10.1007/bf02283689openalex-snapshot

A parallel algorithm for partially separable non-convex global minimization: Linear constraints

inferredcites →https://doi.org/10.1007/bf02997589openalex-snapshot

Multiflots de coût minimal avec fonctions de coût concaves

inferredcites →https://doi.org/10.1007/bfb0000035openalex-snapshot

Constrained Global Optimization: Algorithms and Applications

inferredcites →https://doi.org/10.1007/bfb0006173openalex-snapshot

Asynchronous parallel search in global optimization problems

inferredcites →https://doi.org/10.1016/0096-3003(89)90014-3openalex-snapshot

Parallel search algorithms in global optimization

inferredcites →https://doi.org/10.1016/0167-6377(88)90049-1openalex-snapshot

Checking local optimality in constrained quadratic programming is NP-hard

inferredcites →https://doi.org/10.1016/0167-8191(88)90080-4openalex-snapshot

State-of-the-art in parallel nonlinear optimization

inferredcites →https://doi.org/10.1016/0167-8191(89)90089-6openalex-snapshot

Mathematical modeling of a parallel global optimization algorithm

inferredcites →https://doi.org/10.1016/0377-2217(80)90109-5openalex-snapshot

An algorithm for the min concave cost flow problem

inferredcites →https://doi.org/10.1057/jors.1990.45openalex-snapshot

New Computer Methods for Global Optimization

inferredcites →https://doi.org/10.1080/01966324.1984.10737135openalex-snapshot

Stochastic Methods for Global Optimization

inferredcites →https://doi.org/10.1109/dmcc.1990.555394openalex-snapshot

Parallel Nonlinear Optimization

inferredcites →https://doi.org/10.1137/0909022openalex-snapshot

Global Optimization Approach to the Linear Complementarity Problem

inferredcites →https://doi.org/10.1287/ijoc.1.1.20openalex-snapshot

Parallel Numerical Optimization: Current Status and an Annotated Bibliography

inferredcites →https://doi.org/10.1287/opre.8.1.101openalex-snapshot

Decomposition Principle for Linear Programs

inferredcites →https://doi.org/10.1515/9781400862528.50openalex-snapshot

Performance of Local Search In Minimum Concave-Cost Network Flow Problems

inferredcites →https://doi.org/10.1515/9781400884179-024openalex-snapshot

23. A Decomposition Principle for Linear Programs

inferredcites →https://doi.org/10.21236/ada446514openalex-snapshot

Mathematical Modeling of a Parallel Global Optimization Algorithm

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-60321-2_26openalex-snapshot

Parallel search for combinatorial optimization: Genetic algorithms, simulated annealing, tabu search and GRASP

inferred← citeshttps://doi.org/10.1007/978-0-585-26778-4_7openalex-snapshot

Simulated Annealing and Genetic Algorithms for the Facility Layout Problem: A Survey

inferred← citeshttps://doi.org/10.1007/978-1-4613-3400-2_12openalex-snapshot

Parallel Continuous Non-Convex Optimization

inferred← citeshttps://doi.org/10.1007/978-1-4615-2025-2_11openalex-snapshot

Network Problems

inferred← citeshttps://doi.org/10.1007/978-1-4757-3609-0_7openalex-snapshot

Parallel Metaheuristics for Combinatorial Optimization

inferred← citeshttps://doi.org/10.1007/978-94-011-4570-1_23openalex-snapshot

Nonlinear Assignment Problems

inferred← citeshttps://doi.org/10.1007/bfb0027124openalex-snapshot

Parallel algorithms for global optimization problems

inferred← citeshttps://doi.org/10.1023/a:1008623913524openalex-snapshot

Simulated Annealing and Genetic Algorithms for the Facility Layout Problem: A Survey

inferred← citeshttps://doi.org/10.1080/10556788.2010.551537openalex-snapshot

Parallel branch and bound for global optimization with combination of Lipschitz bounds

inferred← citeshttps://doi.org/10.1371/journal.pone.0204096openalex-snapshot

Laplacian mixture modeling for network analysis and unsupervised learning on graphs

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.