Bixby, R. E.; Marcotte, O. M.-C.; Trotter, L. E. jun. Packing and covering with integral feasible flows in integral supply- demand networks. (English) Zbl 0646.90033 Math. Program. 39, 231-239 (1987). Reviewer: C.Radu MSC: 90B10 90C35 68Q25 05B40 PDFBibTeX XMLCite \textit{R. E. Bixby} et al., Math. Program. 39, 231--239 (1987; Zbl 0646.90033) Full Text: DOI
Cook, W.; Gerards, A. M. H.; Schrijver, A.; Tardos, É. Sensitivity theorems in integer linear programming. (English) Zbl 0648.90055 Math. Program. 34, No. 3, 251-264 (1986). MSC: 90C10 90C05 90C31 PDFBibTeX XMLCite \textit{W. Cook} et al., Math. Program. 34, 251--264 (1986; Zbl 0648.90055) Full Text: DOI
Megiddo, Nimrod Improved asymptotic analysis of the average number of steps performed by the self-dual simplex algorithm. (English) Zbl 0618.90061 Math. Program. 35, 140-172 (1986). MSC: 90C05 68Q25 PDFBibTeX XMLCite \textit{N. Megiddo}, Math. Program. 35, 140--172 (1986; Zbl 0618.90061) Full Text: DOI
Filar, Jerzy A.; Schultz, Todd A. Nonlinear programming and stationary strategies in stochastic games. (English) Zbl 0617.93051 Math. Program. 34, 243-247 (1986). Reviewer: G.Olsder MSC: 91A60 90C30 91A15 PDFBibTeX XMLCite \textit{J. A. Filar} and \textit{T. A. Schultz}, Math. Program. 34, 243--247 (1986; Zbl 0617.93051) Full Text: DOI
McDiarmid, Colin On the greedy algorithm with random costs. (English) Zbl 0616.90057 Math. Program. 36, 245-255 (1986). MSC: 90C27 05B35 PDFBibTeX XMLCite \textit{C. McDiarmid}, Math. Program. 36, 245--255 (1986; Zbl 0616.90057) Full Text: DOI
Fujishige, Satoru A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm. (English) Zbl 0597.90029 Math. Program. 35, 298-308 (1986). MSC: 90B10 90C35 68Q25 PDFBibTeX XMLCite \textit{S. Fujishige}, Math. Program. 35, 298--308 (1986; Zbl 0597.90029) Full Text: DOI
Hansen, Pierre; Jaumard, Brigitte; Minoux, Michel A linear expected-time algorithm for deriving all logical conclusions implied by a set of Boolean inequalities. (English) Zbl 0596.90067 Math. Program. 34, 223-231 (1986). Reviewer: N.Y.Yanev MSC: 90C09 PDFBibTeX XMLCite \textit{P. Hansen} et al., Math. Program. 34, 223--231 (1986; Zbl 0596.90067) Full Text: DOI
Balinski, M. L. A competitive (dual) simplex method for the assignment problem. (English) Zbl 0596.90064 Math. Program. 34, 125-141 (1986). Reviewer: M.Bastian MSC: 90C08 90C05 68Q25 65K05 PDFBibTeX XMLCite \textit{M. L. Balinski}, Math. Program. 34, 125--141 (1986; Zbl 0596.90064) Full Text: DOI
Sen, S.; Sherali, Hanif D. A class of convergent primal-dual subgradient algorithms for decomposable convex programs. (English) Zbl 0594.90074 Math. Program. 35, 279-297 (1986). MSC: 90C25 90C55 PDFBibTeX XMLCite \textit{S. Sen} and \textit{H. D. Sherali}, Math. Program. 35, 279--297 (1986; Zbl 0594.90074) Full Text: DOI
Fathi, Yahya; Tovey, Craig Affirmative action algorithms. (English) Zbl 0594.90053 Math. Program. 34, 292-301 (1986). MSC: 90C05 65K05 90B10 90C33 90C35 PDFBibTeX XMLCite \textit{Y. Fathi} and \textit{C. Tovey}, Math. Program. 34, 292--301 (1986; Zbl 0594.90053) Full Text: DOI
van Laarhoven, P. J. M. Parallel variable metric algorithms for unconstrained optimization. (English) Zbl 0602.90121 Math. Program. 33, 68-81 (1985). Reviewer: Xue Guoliang MSC: 90C30 49M15 65K05 49M37 PDFBibTeX XMLCite \textit{P. J. M. van Laarhoven}, Math. Program. 33, 68--81 (1985; Zbl 0602.90121) Full Text: DOI
Goldfarb, D. Efficient dual simplex algorithms for the assignment problem. (English) Zbl 0578.90051 Math. Program. 33, 187-203 (1985). Reviewer: W.Stanczak MSC: 90C05 68Q25 65K05 90B10 68R10 05C35 PDFBibTeX XMLCite \textit{D. Goldfarb}, Math. Program. 33, 187--203 (1985; Zbl 0578.90051) Full Text: DOI
Orlin, J. B.; Rothblum, U. G. Computing optimal scalings by parametric network algorithms. (English) Zbl 0573.90095 Math. Program. 32, 1-10 (1985). Reviewer: D.T.Ivanchev MSC: 90C35 PDFBibTeX XMLCite \textit{J. B. Orlin} and \textit{U. G. Rothblum}, Math. Program. 32, 1--10 (1985; Zbl 0573.90095) Full Text: DOI
Gavish, Bezalel; Pirkul, Hasan Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality. (English) Zbl 0571.90065 Math. Program. 31, 78-105 (1985). MSC: 90C10 90C09 65K05 PDFBibTeX XMLCite \textit{B. Gavish} and \textit{H. Pirkul}, Math. Program. 31, 78--105 (1985; Zbl 0571.90065) Full Text: DOI
Jeromin, Bernd; Körner, Frank On the refinement of bounds of heuristic algorithms for the traveling salesman problem. (English) Zbl 0564.90040 Math. Program. 32, 114-117 (1985). MSC: 90C10 90C35 65K05 PDFBibTeX XMLCite \textit{B. Jeromin} and \textit{F. Körner}, Math. Program. 32, 114--117 (1985; Zbl 0564.90040) Full Text: DOI
Filar, Jerzy A. On stationary equilibria of a single-controller stochastic game. (English) Zbl 0568.93056 Math. Program. 30, 313-325 (1984). Reviewer: T.Basar MSC: 91A60 91A05 91A15 PDFBibTeX XMLCite \textit{J. A. Filar}, Math. Program. 30, 313--325 (1984; Zbl 0568.93056) Full Text: DOI
Martin, R. Kipp; Sweeney, Dennis J. An ideal column algorithm for integer programs with special ordered sets of variables. (English) Zbl 0517.90050 Math. Program. 26, 48-63 (1983). MSC: 90C10 65K05 PDFBibTeX XMLCite \textit{R. K. Martin} and \textit{D. J. Sweeney}, Math. Program. 26, 48--63 (1983; Zbl 0517.90050) Full Text: DOI
Orlin, James B. Maximum-throughput dynamic network flows. (English) Zbl 0516.90027 Math. Program. 27, 214-231 (1983). MSC: 90B10 90C10 90C35 90B35 PDFBibTeX XMLCite \textit{J. B. Orlin}, Math. Program. 27, 214--231 (1983; Zbl 0516.90027) Full Text: DOI
Murtagh, B. A.; Soliman, F. I. Subgradient optimization applied to a discrete nonlinear problem in engineering design. (English) Zbl 0502.90081 Math. Program. 25, 1-12 (1983). MSC: 90C35 90C90 90B10 65K05 PDFBibTeX XMLCite \textit{B. A. Murtagh} and \textit{F. I. Soliman}, Math. Program. 25, 1--12 (1983; Zbl 0502.90081) Full Text: DOI
Burkard, R. E.; Fincke, U. On random quadratic bottleneck assignment problems. (English) Zbl 0479.90063 Math. Program. 23, 227-232 (1982). MSC: 90C20 90C35 PDFBibTeX XMLCite \textit{R. E. Burkard} and \textit{U. Fincke}, Math. Program. 23, 227--232 (1982; Zbl 0479.90063) Full Text: DOI
Jarvis, John J.; Tufekci, Suleyman Decomposition algorithms for locating minimal cuts in a network. (English) Zbl 0475.90082 Math. Program. 22, 316-331 (1982). MSC: 90C35 90B10 68Q25 65K05 PDFBibTeX XMLCite \textit{J. J. Jarvis} and \textit{S. Tufekci}, Math. Program. 22, 316--331 (1982; Zbl 0475.90082) Full Text: DOI
Maurras, J. F.; Truemper, K.; Akguel, M. Polynomial algorithms for a class of linear programs. (English) Zbl 0509.90056 Math. Program. 21, 121-136 (1981). MSC: 90C05 68Q25 65K05 90C10 15B36 PDFBibTeX XMLCite \textit{J. F. Maurras} et al., Math. Program. 21, 121--136 (1981; Zbl 0509.90056) Full Text: DOI
Bertsekas, Dimitri P. A new algorithm for the assignment problem. (English) Zbl 0461.90069 Math. Program. 21, 152-171 (1981). MSC: 90C35 68Q25 65K05 90B10 90C05 PDFBibTeX XMLCite \textit{D. P. Bertsekas}, Math. Program. 21, 152--171 (1981; Zbl 0461.90069) Full Text: DOI
Balas, Egon; Christofides, Nicos A restricted Lagrangean approach to the traveling salesman problem. (English) Zbl 0461.90068 Math. Program. 21, 19-46 (1981). MSC: 90C35 65K05 68Q25 05C35 05C45 PDFBibTeX XMLCite \textit{E. Balas} and \textit{N. Christofides}, Math. Program. 21, 19--46 (1981; Zbl 0461.90068) Full Text: DOI
Christofides, N.; Mingozzi, A.; Toth, P. Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. (English) Zbl 0461.90067 Math. Program. 20, 255-282 (1981). MSC: 90C35 65K05 05C35 90C39 05C05 PDFBibTeX XMLCite \textit{N. Christofides} et al., Math. Program. 20, 255--282 (1981; Zbl 0461.90067) Full Text: DOI
Hsu, Wen-lian; Ikura, Yoshiro; Nemhauser, George L. A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles. (English) Zbl 0452.90084 Math. Program. 20, 225-232 (1981). MSC: 90C35 05C35 68Q25 68R10 PDFBibTeX XMLCite \textit{W.-l. Hsu} et al., Math. Program. 20, 225--232 (1981; Zbl 0452.90084) Full Text: DOI
Karwan, Mark H.; Rardin, Ronald L. Some relationships between Lagrangian and surrogate duality in integer programming. (English) Zbl 0421.90056 Math. Program. 17, 320-334 (1979). MSC: 90C10 65K05 PDFBibTeX XMLCite \textit{M. H. Karwan} and \textit{R. L. Rardin}, Math. Program. 17, 320--334 (1979; Zbl 0421.90056) Full Text: DOI
Guignard, Monique; Spielberg, Kurt A direct dual method for the mixed plant location problem with some side constraints. (English) Zbl 0416.90052 Math. Program. 17, 198-228 (1979). MSC: 90C11 90C10 65K05 PDFBibTeX XMLCite \textit{M. Guignard} and \textit{K. Spielberg}, Math. Program. 17, 198--228 (1979; Zbl 0416.90052) Full Text: DOI
Miliotis, P. Using cutting planes to solve the symmetric travelling salesman problem. (English) Zbl 0393.90059 Math. Program. 15, 177-188 (1978). MSC: 90C09 05C35 05C38 65K05 68Q25 PDFBibTeX XMLCite \textit{P. Miliotis}, Math. Program. 15, 177--188 (1978; Zbl 0393.90059) Full Text: DOI
Yamamoto, Y. The Held-Karp algorithm and degree-constrained minimum 1-trees. (English) Zbl 0387.90097 Math. Program. 15, 228-231 (1978). MSC: 90C35 05C35 94C15 PDFBibTeX XMLCite \textit{Y. Yamamoto}, Math. Program. 15, 228--231 (1978; Zbl 0387.90097) Full Text: DOI
Svestka, Joseph A. A continuous variable representation of the traveling salesman problem. (English) Zbl 0386.90058 Math. Program. 15, 211-213 (1978). MSC: 90C35 90B10 PDFBibTeX XMLCite \textit{J. A. Svestka}, Math. Program. 15, 211--213 (1978; Zbl 0386.90058) Full Text: DOI
Papadimitriou, Christos H. The adjacency relation on the traveling salesman polytope is NP-complete. (English) Zbl 0376.90067 Math. Program. 14, 312-324 (1978). MSC: 90C05 05C35 PDFBibTeX XMLCite \textit{C. H. Papadimitriou}, Math. Program. 14, 312--324 (1978; Zbl 0376.90067) Full Text: DOI
Bazaraa, Mokhtar S.; Goode, Jamie J. The traveling salesman problem: A duality approach. (English) Zbl 0377.90092 Math. Program. 13, 221-237 (1977). MSC: 90C10 65K05 PDFBibTeX XMLCite \textit{M. S. Bazaraa} and \textit{J. J. Goode}, Math. Program. 13, 221--237 (1977; Zbl 0377.90092) Full Text: DOI
Goffin, J. L. On convergence rates of subgradient optimization methods. (English) Zbl 0368.90119 Math. Program. 13, 329-347 (1977). MSC: 90C30 41A25 PDFBibTeX XMLCite \textit{J. L. Goffin}, Math. Program. 13, 329--347 (1977; Zbl 0368.90119) Full Text: DOI
Srinivasan, V.; Thompson, G. L. Cost operator algorithms for the transportation problem. (English) Zbl 0362.90058 Math. Program. 12, 372-391 (1977). MSC: 90C05 65K05 PDFBibTeX XMLCite \textit{V. Srinivasan} and \textit{G. L. Thompson}, Math. Program. 12, 372--391 (1977; Zbl 0362.90058) Full Text: DOI
Fisher, Marshall L. A dual algorithm for the one-machine scheduling problem. (English) Zbl 0359.90039 Math. Program. 11(1976), 229-251 (1977). MSC: 90B35 90C10 PDFBibTeX XMLCite \textit{M. L. Fisher}, Math. Program. 11, 229--251 (1977; Zbl 0359.90039) Full Text: DOI
Savage, Sam L. Some theoretical implications of local optimization. (English) Zbl 0349.90120 Math. Program. 10, 354-366 (1976). MSC: 90C10 90C35 90C30 41A60 PDFBibTeX XMLCite \textit{S. L. Savage}, Math. Program. 10, 354--366 (1976; Zbl 0349.90120) Full Text: DOI
Miliotis, P. Integer programming approaches to the travelling salesman problem. (English) Zbl 0337.90041 Math. Program. 10, 367-378 (1976). MSC: 90C10 65K05 90C05 PDFBibTeX XMLCite \textit{P. Miliotis}, Math. Program. 10, 367--378 (1976; Zbl 0337.90041) Full Text: DOI
Padberg, Manfred W.; Rao, M. R. The travelling salesman problem and a class of polyhedra of diameter two. (English) Zbl 0318.90042 Math. Program. 7, 32-45 (1974). MSC: 90C10 90C35 PDFBibTeX XMLCite \textit{M. W. Padberg} and \textit{M. R. Rao}, Math. Program. 7, 32--45 (1974; Zbl 0318.90042) Full Text: DOI
Helbig Hansen, Keld; Krarup, Jakob Improvements of the Held-Karp algorithm for the symmetric traveling- salesman problem. (English) Zbl 0285.90055 Math. Program. 7, 87-96 (1974). MSC: 90C10 65K05 PDFBibTeX XMLCite \textit{K. Helbig Hansen} and \textit{J. Krarup}, Math. Program. 7, 87--96 (1974; Zbl 0285.90055) Full Text: DOI
Held, Michael; Wolfe, Philip; Crowder, Harlan P. Validation of subgradient optimization. (English) Zbl 0284.90057 Math. Program. 6, 62-88 (1974). MSC: 90C05 90C10 PDFBibTeX XMLCite \textit{M. Held} et al., Math. Program. 6, 62--88 (1974; Zbl 0284.90057) Full Text: DOI
Jeroslow, R. G. Trivial integer programs unsolvable by branch-and-bound. (English) Zbl 0283.90035 Math. Program. 6, 105-109 (1974). MSC: 90C10 PDFBibTeX XMLCite \textit{R. G. Jeroslow}, Math. Program. 6, 105--109 (1974; Zbl 0283.90035) Full Text: DOI
Murphy, Fredric H. A column generation algorithm for nonlinear programming. (English) Zbl 0288.90070 Math. Program. 5, 286-298 (1973). MSC: 90C30 PDFBibTeX XMLCite \textit{F. H. Murphy}, Math. Program. 5, 286--298 (1973; Zbl 0288.90070) Full Text: DOI
Zadeh, Norman A bad network problem for the simplex method and other minimum cost flow algorithms. (English) Zbl 0287.90030 Math. Program. 5, 255-266 (1973). MSC: 90C35 90B10 PDFBibTeX XMLCite \textit{N. Zadeh}, Math. Program. 5, 255--266 (1973; Zbl 0287.90030) Full Text: DOI
Zadeh, Norman More pathological examples for network flow problems. (English) Zbl 0272.90081 Math. Program. 5, 217-224 (1973). MSC: 90B10 90C35 PDFBibTeX XMLCite \textit{N. Zadeh}, Math. Program. 5, 217--224 (1973; Zbl 0272.90081) Full Text: DOI
Padberg, Manfred W. On the facial structure of set packing polyhedra. (English) Zbl 0272.90041 Math. Program. 5, 199-215 (1973). MSC: 90C10 PDFBibTeX XMLCite \textit{M. W. Padberg}, Math. Program. 5, 199--215 (1973; Zbl 0272.90041) Full Text: DOI
Syslo, Maciej M. A new solvable case of the traveling salesman problem. (English) Zbl 0257.90025 Math. Program. 4, 347-348 (1973). MSC: 90C10 PDFBibTeX XMLCite \textit{M. M. Syslo}, Math. Program. 4, 347--348 (1973; Zbl 0257.90025) Full Text: DOI
Held, Michael; Karp, Richard M. The traveling-salesman problem and minimum spanning trees. II. (English) Zbl 0232.90038 Math. Program. 1, 6-25 (1971). MSC: 90C10 PDFBibTeX XMLCite \textit{M. Held} and \textit{R. M. Karp}, Math. Program. 1, 6--25 (1971; Zbl 0232.90038) Full Text: DOI
Hu, T. C. Some problems in discrete optimization. (English) Zbl 0228.90031 Math. Program. 1, 102-112 (1971). MSC: 90C10 90B10 90C08 PDFBibTeX XMLCite \textit{T. C. Hu}, Math. Program. 1, 102--112 (1971; Zbl 0228.90031) Full Text: DOI