Mokhtar S. Bazaraa

From MaRDI portal
Person:1149882

Available identifiers

zbMath Open bazaraa.mokhtar-sMaRDI QIDQ1149882

List of research outcomes





PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q36490862009-12-02Paper
An optimization approach for planning daily drayage operations2008-05-27Paper
Nonlinear Programming2006-07-10Paper
https://portal.mardi4nfdi.de/entity/Q46736302005-05-06Paper
https://portal.mardi4nfdi.de/entity/Q31602762005-02-07Paper
https://portal.mardi4nfdi.de/entity/Q31348731993-09-20Paper
https://portal.mardi4nfdi.de/entity/Q39983961992-09-17Paper
A branch-and-bound-based heuristic for solving the quadratic assignment problem1983-01-01Paper
A least-distance programming procedure for minimization problems under linear constraints1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33201441982-01-01Paper
On the Use of Exact and Heuristic Cutting Plane Methods for the Quadratic Assignment Problem1982-01-01Paper
An algorithm for solving linearly constrained minimax problems1982-01-01Paper
Sufficient conditions for a globally exact penalty function without convexity1982-01-01Paper
A property regarding degenerate pivots for linear assignment networks1982-01-01Paper
On the choice of step size in subgradient optimization1981-01-01Paper
A versatile scheme for ranking the extreme points of an assignment polytope1981-01-01Paper
An algorithm for linearly constrained nonlinear programming problems1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39224901981-01-01Paper
Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem1980-01-01Paper
On the convergence of a class of algorithms using linearly independent search directions1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39325761979-01-01Paper
A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality1979-01-01Paper
An exact branch-and-bound procedure for the quadratic-assignment problem1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41962491979-01-01Paper
The Topkis-Veinott algorithm for solving nonlinear programs with lower and upper bounded variables1979-01-01Paper
An algorithm for finding the shortest element of a polyhedral set with application to Lagrangian duality1978-01-01Paper
A finite steepest-ascent algorithm for maximizing piecewise-linear concave functions1978-01-01Paper
The traveling salesman problem: A duality approach1977-01-01Paper
Note—On the Use of Fictitious Bounds in Tree Search Algorithms1977-01-01Paper
Foundations of optimization1976-01-01Paper
Nonlinear programming without differentiability in banach spaces: necessary and sufficient constraint qualification1976-01-01Paper
A Cutting-Plane Algorithm for the Quadratic Set-Covering Problem1975-01-01Paper
A saddle-point criterion for convex problems with infinite-dimensional equality constraints1975-01-01Paper
An efficient cyclic coordinate method for optimizing penalty functions1975-01-01Paper
On the cones of tangents with applications to mathematical programming1974-01-01Paper
A Dual Shortest Path Algorithm1974-01-01Paper
Inventory models with a mixture of backorders and lost sales1973-01-01Paper
On Symmetric Duality in Nonlinear Programming1973-01-01Paper
Necessary optimality criteria in mathematical programming in normed linear spaces1973-01-01Paper
A theorem of the alternative with application to convex programming: optimality, duality, and stability1973-01-01Paper
Geometry and resolution of duality gaps1973-01-01Paper
Extension of optimality conditions via supporting functions1973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41170151973-01-01Paper
Necessary optimality criteria in mathematical programming in the presence of differentiability1972-01-01Paper
Constraint Qualifications Revisited1972-01-01Paper
Optimality Criteria in Nonlinear Programming Without Differentiability1971-01-01Paper
Technical Note—A Unified Nonlinear Duality Formulation1971-01-01Paper

Research outcomes over time

This page was built for person: Mokhtar S. Bazaraa