Pages that link to "Item:Q4376170"

The following pages link to Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications (Q4376170):

Displaying 22 items.

• The one-machine just-in-time scheduling problem with preemption (Q1013290) (← links)
• New algorithms for convex cost tension problem with application to computer vision (Q1040084) (← links)
• Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix (Q1646575) (← links)
• Scheduling for electricity cost in a smart grid (Q1702731) (← links)
• Greedy oriented flows (Q1751094) (← links)
• A minimum mean cycle cancelling method for nonlinear multicommodity flow problems (Q1972012) (← links)
• Optimal deterministic and robust selection of electricity contracts (Q2124812) (← links)
• A faster strongly polynomial time algorithm to solve the minimum cost tension problem (Q2410039) (← links)
• An \(O(n(m+n\log n)\log n)\) time algorithm to solve the minimum cost tension problem (Q2424659) (← links)
• On the complexity of general matrix scaling and entropy minimization via the RAS algorithm (Q2465654) (← links)
• Complexity and algorithms for nonlinear optimization problems (Q2480263) (← links)
• Maximum network flows with concave gains (Q2492702) (← links)
• Local optimality conditions for multicommodity flow problems with separable piecewise convex costs (Q2643798) (← links)
• A Polynomial-Time Descent Method for Separable Convex Optimization Problems with Linear Constraints (Q2802141) (← links)
• A Strongly Polynomial Algorithm for a Class of Minimum-Cost Flow Problems with Separable Convex Objectives (Q2817799) (← links)
• Scheduling for Electricity Cost in Smart Grid (Q2867129) (← links)
• Parametric maximum flow methods for minimax approximation of target quotas in biproportional apportionment (Q2892156) (← links)
• A Polynomial Time Algorithm for Solving the Closest Vector Problem in Zonotopal Lattices (Q5163506) (← links)
• (Q5743452) (← links)
• Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization (Q5867626) (← links)
• Minimum ratio canceling in oracle polynomial for linear programming, but not strongly polynomial, even for networks (Q5929137) (← links)
• On project scheduling with irregular starting time costs (Q5945382) (← links)