The following pages link to Mathematical Programming Studies (Q3025760):
Displaying 50 items.
- On the expressibility of piecewise-linear continuous functions as the difference of two piecewise-linear convex functions (Q3025761) (← links)
- A reduced subgradient algorithm (Q3026768) (← links)
- Extensions of the continuity of point-to-set maps: Applications to fixed point algorithms (Q3050146) (← links)
- A comparative study of several general convergence conditions for algorithms modeled by point-to-set maps (Q3208449) (← links)
- Multipoint methods for separable nonlinear networks (Q3216399) (← links)
- Faces of dual transportation polyhedra (Q3216429) (← links)
- Modelling with integer variables (Q3217950) (← links)
- Performance of approximate algorithms for global minimization (Q3217953) (← links)
- Orientation of matrices (Q3218146) (← links)
- Covering directed and odd cuts (Q3220093) (← links)
- Numerical methods for basic solutions of generalized flow networks (Q3220317) (← links)
- A submodular network simplex method (Q3220318) (← links)
- A polynomial-time test for total dual integrality in fixed dimension (Q3221757) (← links)
- Node-weighted graphs having the König-Egerváry property (Q3222885) (← links)
- Characterizations of the plenary hull of the generalized Jacobian matrix (Q3314091) (← links)
- Uncapacitated lot-sizing: The convex hull of solutions (Q3343777) (← links)
- Some optimization problems with extremal operations (Q3347667) (← links)
- Inaccuracy in quasi-Newton methods: Local improvement theorems (Q3681845) (← links)
- Inner estimates for the generalized gradient of the optimal value function in nonlinear programming (Q3690597) (← links)
- Local structure of feasible sets in nonlinear programming, part II: Nondegeneracy (Q3691427) (← links)
- Finite solution of pure trade markets with Cobb-Douglas utilities (Q3693198) (← links)
- Dynamic general equilibrium tax models with adjustment costs (Q3693201) (← links)
- A three-region intertemporal model of energy, international trade and capital flows (Q3693202) (← links)
- Coping with a foreign exchange crisis: A general equilibrium model of alternative adjustment mechanisms (Q3693296) (← links)
- A computational approach to optimum public policies (Q3693299) (← links)
- Alternative algorithms for computing economic equilibria (Q3693300) (← links)
- Sequential optimization and complementarity techniques for computing economic equilibria (Q3693301) (← links)
- On the formulation and solution of economic equilibrium models (Q3694948) (← links)
- An introduction to the octahedral algorithm for the computation of economic equilibria (Q3701156) (← links)
- A numerical investigation of multiplicity of equilibria (Q3701157) (← links)
- Computing solutions to generalized equilibrium models by successive under-relaxation (Q3702795) (← links)
- General equilibrium with wage rigidities: An application to Belgium (Q3703544) (← links)
- Methods of solution for dynamic rational expectations models: A survey (Q3703549) (← links)
- Computation of economic equilibria by a sequence of linear complementarity problems (Q3703675) (← links)
- Computational comparison of two solution procedures for allocation/processing networks (Q3712095) (← links)
- Common aspects of several network flow algorithms (Q3712096) (← links)
- A new heuristic for determining fleet size and composition (Q3712124) (← links)
- Vehicle routing and scheduling with time windows (Q3712128) (← links)
- A class of network design problems with multiple demand: Model formulation and an algorithmic approach (Q3713827) (← links)
- Variations on the integral decomposition property (Q3713862) (← links)
- A motivation for using the truncated Newton approach in a very large scale nonlinear network problem (Q3713879) (← links)
- Advanced start for the multicommodity network flow problem (Q3714875) (← links)
- Finding all optimal solutions to the network flow problem (Q3714876) (← links)
- A game-theoretic approach to network equilibrium (Q3714877) (← links)
- A heuristic procedure for calculating telecommunication transmission networks in consideration of network reliability (Q3714879) (← links)
- Some experience in applying a stochastic method to location problems (Q3716772) (← links)
- Solving integer minimum cost flows with separable convex cost objective polynomially (Q3716775) (← links)
- Normal solutions of linear programs (Q3716811) (← links)
- A short note on matching algorithms (Q3716816) (← links)
- A linear programming approach to the optimum network orientation problem (Q3716851) (← links)
