The following pages link to (Q3730336):
Displayed 50 items.
- Sufficient conditions for coincidence in \(\ell_ 1\)-minisum multifacility location problems (Q1362523) (← links)
- Discrete optimization in public rail transport (Q1365068) (← links)
- Feasibility in capacitated networks: The effect of individual arcs and nodes (Q1380444) (← links)
- Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem. (Q1421475) (← links)
- Guaranteed cost control for multi-inventory systems with uncertain demand. (Q1428689) (← links)
- Theory of uncontrollable flows -- a new type of network-flow theory as a model for the 21st century of multiple values (Q1608406) (← links)
- Conjugacy relationship between M-convex and L-convex functions in continuous variables (Q1764239) (← links)
- Use of primal-dual technique in the network algorithm for two-way contingency tables (Q1774297) (← links)
- A forward/reverse auction algorithm for asymmetric assignment problems (Q1803649) (← links)
- Sensitivity analysis of a railway station track layout with respect to a given timetable (Q1806663) (← links)
- Implementation and test of auction methods for solving generalized network flow problems with separable convex cost (Q1810926) (← links)
- A data parallel augmenting path algorithm for the dense linear many-to-one assignment problem (Q1814992) (← links)
- Monotone discontinuity of lattice operations in a quasilinear harmonic space (Q1816456) (← links)
- Future paths for integer programming and links to artificial intelligence (Q1821034) (← links)
- Extension of M-convexity and L-convexity to polyhedral convex functions (Q1841175) (← links)
- Optimal matching problem in detection and recognition performance evaluation (Q1860170) (← links)
- Quadratic M-convex and L-convex functions (Q1883382) (← links)
- Finite method for a nonlinear allocation problem (Q1896578) (← links)
- Linearly constrained convex programming as unconstrained differentiable concave programming (Q1897463) (← links)
- Asynchronous gradient algorithms for a class of convex separable network flow problems (Q1915768) (← links)
- Network games; adaptations to Nash-Cournot equilibrium (Q1918427) (← links)
- Feasibility in uncapacitated networks: The effect of individual arcs and nodes (Q1918428) (← links)
- Restricted recourse strategies for bounding the expected network recourse function (Q1918432) (← links)
- Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming (Q2277367) (← links)
- Convergent Lagrangian heuristics for nonlinear minimum cost network flows (Q2480971) (← links)
- Generation of classes of robust periodic railway timetables (Q2489288) (← links)
- Robust control strategies for multi--inventory systems with average flow constraints (Q2507912) (← links)
- Substitutes and complements in network flows viewed as discrete convexity (Q2581320) (← links)
- Local optimality conditions for multicommodity flow problems with separable piecewise convex costs (Q2643798) (← links)
- The role of pivoting in proving some fundamental theorems of linear algebra (Q2644727) (← links)
- The simplex algorithm for multicommodity networks (Q2782728) (← links)
- A unified framework for primal-dual methods in minimum cost network flow problems (Q3683845) (← links)
- A simplex algorithm for piecewise-linear programming I: Derivation and proof (Q3703668) (← links)
- Piecewise-linear programming: The compact (CPLP) algorithm (Q3754440) (← links)
- A geometric approach to nonsmooth optimization with sample applications (Q3769492) (← links)
- A piecewise linear upper bound on the network recourse function (Q3770284) (← links)
- Relaxation methods for problems with strictly convex separable costs and linear constraints (Q3777809) (← links)
- Investing in arcs in a network to maximize the expected max flow (Q3786255) (← links)
- On node constraint networks (Q3787765) (← links)
- Tracing the characteristic curve of a quadratic black box (Q3832348) (← links)
- A simplex-like method with bisection for linear programming<sup>1</sup> (Q3979523) (← links)
- Sandwich approximation of univariate convex functions with an application to separable convex programming (Q3987782) (← links)
- Ripples, complements, and substitutes in singly constrained monotropic parametric network flow problems (Q4305123) (← links)
- A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows (Q4342969) (← links)
- Transporting and Mixing Gasses with Different Qualities (Q4350498) (← links)
- Transporting and Mixing Gasses with Different Qualities (Q4352656) (← links)
- (Q4362979) (← links)
- A dual scheme for traffic assignment problems (Q4375434) (← links)
- Analytic efficient solution set for bi-criteria quadratic network programs (Q4378939) (← links)
- An exact algorithm for the min-cost network containment problem (Q4458721) (← links)