On the public citation graph

Proceedings of the Princeton Symposium on Mathematical Programming

https://doi.org/10.2307/2005190

0 signed · 51 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 points at this work

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

inferred← citeshttps://doi.org/10.1002/1520-6750(199502)42:1<81::aid-nav3220420108>3.0.co;2-xopenalex-snapshot

Weighted vertex packing problem for specially structured geometric graphs

inferred← citeshttps://doi.org/10.1002/9781118627372.refsopenalex-snapshot

References

inferred← citeshttps://doi.org/10.1002/nme.1620240704openalex-snapshot

A basis change strategy for the reduced gradient method and the optimum design of large structures

inferred← citeshttps://doi.org/10.1007/978-1-0716-5076-9_6openalex-snapshot

Geometric Programming

inferred← citeshttps://doi.org/10.1007/978-1-4615-3600-0_31openalex-snapshot

An Optimal Stopping Game in a Restricted Market

inferred← citeshttps://doi.org/10.1007/978-1-4757-2640-4_13openalex-snapshot

A Chain Condition for Qo-Matrices

inferred← citeshttps://doi.org/10.1007/978-1-4757-3141-5_2openalex-snapshot

Complementarity Problems. Origins and Definitions

inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_634-1openalex-snapshot

Stable Set Problem: Branch & Cut Algorithms

inferred← citeshttps://doi.org/10.1007/978-3-642-13036-6_21openalex-snapshot

An Integer Programming and Decomposition Approach to General Chance-Constrained Mathematical Programs

inferred← citeshttps://doi.org/10.1007/978-3-642-32147-4_8openalex-snapshot

A Second-Order Cone Programming Approximation to Joint Chance-Constrained Linear Programs

inferred← citeshttps://doi.org/10.1007/978-3-642-51697-9_5openalex-snapshot

On Integrated Chance Constraints

inferred← citeshttps://doi.org/10.1007/978-3-642-88272-2_17openalex-snapshot

Stochastic Optimization Models for Machining Operations

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

Domination structures and multicriteria problems in n-person games

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

A finite steepest-ascent algorithm for maximizing piecewise-linear concave functions

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

Detecting all evolutionarily stable strategies

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

The Nakamura Theorem for coalition structures of quota games

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

The general quadratic optimization problem

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

Validation of subgradient optimization

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

Break minimization

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

A modified reduced gradient method for a class of nondifferentiable problems

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

Shadow prices in nonconvex mathematical programming

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

Linear complementarity problems with an invariant number of solutions

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

Hybrid programs: Linear and least-distance

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

Using copositivity for global optimality criteria in concave quadratic programming problems

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

On the integer-valued variables in the linear vertex packing problem

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

LipschitzianQ-matrices areP-matrices

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

A dual ascent approach for steiner tree problems on a directed graph

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

On manifestations of the Schur complement

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

On integrated chance constraints

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

A heuristic algorithm for mixed-integer programming problems

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

Nonanticipativity and L 1-martingales in stochastic optimization problems

inferred← citeshttps://doi.org/10.1007/s00453-012-9660-4openalex-snapshot

Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem

inferred← citeshttps://doi.org/10.1007/s10479-014-1743-yopenalex-snapshot

On a quadratic programming problem involving distances in trees

inferred← citeshttps://doi.org/10.1007/s10957-010-9754-6openalex-snapshot

A Sampling-and-Discarding Approach to Chance-Constrained Optimization: Feasibility and Optimality

inferred← citeshttps://doi.org/10.1007/s12351-016-0272-7openalex-snapshot

Completely mixed strategies for single controller unichain semi-Markov games with undiscounted payoffs

inferred← citeshttps://doi.org/10.1016/0095-8956(92)90037-xopenalex-snapshot

Fractional matroid matchings

inferred← citeshttps://doi.org/10.1016/b978-0-08-022029-1.50029-6openalex-snapshot

Hierarchical economic dispatching in electric power systems with load uncertainties

inferred← citeshttps://doi.org/10.1016/b978-813120376-7/50031-2openalex-snapshot

Bibliography

inferred← citeshttps://doi.org/10.1016/j.disopt.2003.12.003openalex-snapshot

The computational complexity of the elimination problem in generalized sports competitions

inferred← citeshttps://doi.org/10.1016/j.ejor.2020.02.009openalex-snapshot

Weighted-additive fuzzy multi-choice goal programming (WA-FMCGP) for supporting renewable energy site selection decisions

inferred← citeshttps://doi.org/10.1017/9781108778619.001openalex-snapshot

Preface

inferred← citeshttps://doi.org/10.1017/9781108778619.008openalex-snapshot

Index

inferred← citeshttps://doi.org/10.1029/wr023i012p02227openalex-snapshot

Stochastic water quality optimization using imbedded chance constraints

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

A differentiation formula for integrals overseas given by inclusion

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

Semi-infinite probabilistic optimization: first-order stochastic dominance constrain

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

Stochastic optimal design in multivariate stratified sampling

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

A NUMERICAL PROCEDURE FOR SENSITIVITY ANALYSIS IN GEOMETRIC PROGRAMMING

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

A Survey of Nonlinear Programming

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

A Survey of Nonlinear Programming

inferred← citeshttps://doi.org/10.1111/j.1540-5915.1980.tb01132.xopenalex-snapshot

STOCHASTIC LINEAR PROGRAMMING WITH RECOURSE: A TUTORIAL*

inferred← citeshttps://doi.org/10.1145/2661631openalex-snapshot

Monte Carlo Methods for Value-at-Risk and Conditional Value-at-Risk

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.