On the public citation graph

Mathematical programming study 2

0 signed · 34 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/(sici)1097-024x(200003)30:3<199::aid-spe296>3.0.co;2-2openalex-snapshot
Marmot: an optimizing compiler for Java
inferred← citeshttps://doi.org/10.1002/aic.690320114openalex-snapshot
Simultaneous optimization and heat integration of chemical processes
inferred← citeshttps://doi.org/10.1002/nav.3800290112openalex-snapshot
On a generalized bin‐packing problem
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_45openalex-snapshot
Reformulation–Linearization Techniques for Discrete Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-1-4471-2256-2_10openalex-snapshot
Touring Polygons
inferred← citeshttps://doi.org/10.1007/978-3-642-13725-9_7openalex-snapshot
A Capacitated Lot Sizing Game with Transshipments, Scarce Capacities, and Player-Dependent Cost Coefficients
inferred← citeshttps://doi.org/10.1007/978-3-642-50317-7_8openalex-snapshot
Models for the optimal design of flexible manufacturing systems
inferred← citeshttps://doi.org/10.1007/978-3-642-52076-1_9openalex-snapshot
Literaturverzeichnis
inferred← citeshttps://doi.org/10.1007/bf00933376openalex-snapshot
Algorithmic equivalence in quadratic programming, I: A least-distance programming problem
inferred← citeshttps://doi.org/10.1007/bf00934366openalex-snapshot
An implementable algorithm for the optimal design centering, tolerancing, and tuning problem
inferred← citeshttps://doi.org/10.1007/bf00938396openalex-snapshot
Optimization of upper semidifferentiable functions
inferred← citeshttps://doi.org/10.1007/bf01391417openalex-snapshot
A quadratic approximation method for minimizing a class of quasidifferentiable functions
inferred← citeshttps://doi.org/10.1007/bf01582893openalex-snapshot
Lagrangean decomposition for integer nonlinear programming with linear constraints
inferred← citeshttps://doi.org/10.1007/bf01587078openalex-snapshot
On strongly degenerate complementary cones and solution rays
inferred← citeshttps://doi.org/10.1007/bf01588308openalex-snapshot
Least-index resolution of degeneracy in quadratic programming
inferred← citeshttps://doi.org/10.1007/bf01743302openalex-snapshot
Methods for optimization of nonlinear problems with discrete variables: A review
inferred← citeshttps://doi.org/10.1007/bf02022036openalex-snapshot
Sensitivity analysis for the matching problem and its use in solving matching problems with a single side constraint
inferred← citeshttps://doi.org/10.1007/bf02097809openalex-snapshot
Models for multimode multicommodity location problems with interdepot balancing requirements
inferred← citeshttps://doi.org/10.1007/s10479-018-3003-zopenalex-snapshot
Large-scale unit commitment under uncertainty: an updated literature survey
inferred← citeshttps://doi.org/10.1016/s0020-7403(00)00095-3openalex-snapshot
Solution of dynamic frictional contact problems using nondifferentiable optimization
inferred← citeshttps://doi.org/10.1080/00207160.2014.881994openalex-snapshot
Clique-perfectness and balancedness of some graph classes
inferred← citeshttps://doi.org/10.1080/02331930410001662199openalex-snapshot
An exact lower order penalty function and its smoothing in nonlinear programming
inferred← citeshttps://doi.org/10.1080/07408170490447339openalex-snapshot
The long-term mine production scheduling problem
inferred← citeshttps://doi.org/10.1080/07408179108963860openalex-snapshot
Aggregate Capacitated Lot-Size Scheduling for a Class of Flexible Machining and Assembly Systems
inferred← citeshttps://doi.org/10.1080/07408179708966382openalex-snapshot
Heuristics for the plate-cutting traveling salesman problem
inferred← citeshttps://doi.org/10.1080/07474939108800204openalex-snapshot
Basic structure of the asymptotic theory in dynamic nonlineaerco nometric models, part i: consistency and approximation concepts
inferred← citeshttps://doi.org/10.1080/09208119008944163openalex-snapshot
Operational ore/waste classification at a surface gold mine
inferred← citeshttps://doi.org/10.1109/ipps.1991.153849openalex-snapshot
PMAC: an environment for parallel programming
inferred← citeshttps://doi.org/10.1111/j.1468-0262.2006.00667.xopenalex-snapshot
Hard-to-Solve Bimatrix Games
inferred← citeshttps://doi.org/10.1111/j.1540-5414.2004.02396.xopenalex-snapshot
Coordinated Capacitated Lot‐Sizing Problem with Dynamic Demand: A Lagrangian Heuristic
inferred← citeshttps://doi.org/10.1137/1022003openalex-snapshot
Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
inferred← citeshttps://doi.org/10.1145/1148109.1148117openalex-snapshot
A general approach for partitioning N-dimensional parallel nested loops with conditionals
inferred← citeshttps://doi.org/10.2514/1.j059784openalex-snapshot
Smooth Local Correlation-Based Transition Model for the Spalart–Allmaras Turbulence Model
inferred← citeshttps://doi.org/10.2514/6.1995-1333openalex-snapshot
Engineering optimization with discrete variables
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.