The following pages link to Johannes Terno (Q915655):
Displayed 50 items.
- Item:Q915655 (redirect page) (← links)
- A genuinely polynomial primal simplex algorithm for the assignment problem (Q686416) (← links)
- O(n\({}^ pL)\)-iteration and \(O(n^ 3L)\)-operation potential reduction algorithms for linear programming (Q805163) (← links)
- On monotonicity in the scaled potential algorithm for linear programming (Q805164) (← links)
- Computing projections for the Karmarkar algorithm (Q806966) (← links)
- A ``build-down'' scheme for linear programming (Q912758) (← links)
- On the stochastic complexity of the asymmetric traveling salesman problem (Q915656) (← links)
- Cost allocation: The traveling salesman, bin packing, and the knapsack (Q922949) (← links)
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs (Q1106724) (← links)
- Algorithms for bound constrained quadratic programming problems (Q1122320) (← links)
- Linearly constrained optimization (Q1122324) (← links)
- A probabilistic heuristic for a computationally difficult set covering problem (Q1122493) (← links)
- The modified integer round-up property of the one-dimensional cutting stock problem (Q1127208) (← links)
- \(\alpha\)-vertex separator is NP-hard even for 3-regular graphs (Q1179551) (← links)
- An algorithm for the fair resource allocation problem with a submodular constraint (Q1179783) (← links)
- A polyhedral approach to edge coloring (Q1180838) (← links)
- Valid inequalities and facets of the capacitated plant location problem (Q1262820) (← links)
- The convergence of quasi-Newton matrices generated by the self-scaling symmetric rank one update (Q1267799) (← links)
- An inexact QP-based method for nonlinear complementarity problems (Q1272819) (← links)
- The solution of two-stage guillotine cutting stock problems having extremely varying order demands (Q1278246) (← links)
- Quasi-Newton methods for nonlinear least squares focusing on curvatures (Q1293245) (← links)
- A generalization of the norm-relaxed method of feasible directions (Q1294211) (← links)
- Calculating uncertainty intervals in approximate equation systems (Q1294585) (← links)
- New cases of the cutting stock problem having MIRUP (Q1298738) (← links)
- On Davidon's collinear scaling algorithms for optimization (Q1332350) (← links)
- A convergent secant method for constrained optimization (Q1335568) (← links)
- Sensitivity analysis of list scheduling heuristics (Q1339396) (← links)
- One-machine generalized precedence constrained scheduling problems (Q1342279) (← links)
- On extrapolation methods in optimization (Q1375439) (← links)
- Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem (Q1376328) (← links)
- An efficient approach for the multi-pallet loading problem (Q1569940) (← links)
- Families of non-IRUP instances of the one-dimensional cutting stock problem (Q1613404) (← links)
- Tighter relaxations for the cutting stock problem (Q1806682) (← links)
- Implementation of an inexact approach to solving linear semi-infinite programming problems (Q1903653) (← links)
- A generalized gradient projection method for optimization problems with equality and inequality constraints about arbitrary initial point (Q1920019) (← links)
- Comparison of independent, stratified and random covering sample schemes in optimization problems (Q1921106) (← links)
- Robust algorithms that locate local extrema of a function of one variable from interval measurement results: A remark (Q1921285) (← links)
- (Q3668283) (← links)
- Complexity investigations on the ellipsoid algorithm (Q3738924) (← links)
- (Q3745624) (← links)
- Guillotine cutting of defective boards (Q3789318) (← links)
- (Q3805803) (← links)
- (Q3806276) (← links)
- Modeling of packing problems (Q3835624) (← links)
- Ein beitrag zur klassifizierung von rundreiseproblemen (Q3867549) (← links)
- (Q3895228) (← links)
- (Q3945940) (← links)
- A new extension principle algorithm for the traveling salesman problem (Q3962804) (← links)
- (Q3989344) (← links)
- (Q4042835) (← links)