Showing 261 - 280 of 1,641

261

A modified simplex approach for solving bilevel linear programming problems
Hayri Önal
European Journal of Operational Research. 67:126-135

Beale's method Hierarchical systems Linear programming Computational methods fo... 0211 other engineering a... 0202 electrical engineer...
Academic journal
Save to List
262

A Lagrangian heuristic for the capacitated plant location problem with single source constraints
Ramaswami Sridharan
European Journal of Operational Research. 66:305-312

Discrete location and as... Lagrangian relaxations bin packing concentrator location Computational methods fo... heuristic
Academic journal
Save to List
263

Linear‐time algorithms for the 2‐connected steiner subgraph problem on special classes of graphs: Linear-time algorithms for the 2-connected Steiner subgraph problem on special classes of graphs
Donald K. Wagner ; Collette R. Coullard ; Abdur Rais ; et al.
Networks. 23:195-206

Computational methods fo... 0211 other engineering a... Halin graphs \(W_ 4\)-free graphs 2-connected Steiner subg... 0102 computer and inform...
Academic journal
Save to List
264

Optimal bin location and sequencing in printed circuit board assembly
L. R. Foulds ; Horst W. Hamacher
European Journal of Operational Research. 66:279-290

optimal bin locations 0209 industrial biotechn... Discrete location and as... efficient production of... Computational methods fo... one-facility location mo...
Academic journal
Save to List
265

Efficient chains in a network with time-cost trade-off function on each arc
V. Rajendra Prasad ; K. P. K. Nair ; Yash P. Aneja
European Journal of Operational Research. 66:392-402

sink node cost-benefit analysis labelling scheme Computational methods fo... 0211 other engineering a... efficient chains
Academic journal
Save to List
266

A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
Jean-Marc Rousseau ; Jean-Yves Potvin
European Journal of Operational Research. 66:331-340

Transportation, logistic... Deterministic scheduling... Computational methods fo... 0211 other engineering a... 02 engineering and techn...
Academic journal
Save to List
267

On the Superlinear Convergence of Interior-Point Algorithms for a General Class of Problems: On the superlinear convergence of interior-point algorithms for a general class of problems
Richard A. Tapia ; Yin Zhang ; Florian A. Potra
SIAM Journal on Optimization. 3:413-422

Numerical mathematical p... \(Q\)-superlinear conver... Linear programming Computational methods fo... 0211 other engineering a... interior-point linear pr...
Academic journal
Save to List
268

An algorithm for the bottleneck generalized assignment problem
Joseph B. Mazzola ; Alan W. Neebe
Computers & Operations Research. 20:355-362

bottleneck 0209 industrial biotechn... Combinatorial optimizati... Discrete location and as... generalized assignment p... Computational methods fo...
Academic journal
Save to List
269

Numerical experiments with one-dimensional adaptive cubic algorithm
Efim A. Galperin ; André Ferrari
Computers & Mathematics with Applications. 25:47-56

Computational Mathematic... Computational Theory and... Nonlinear programming global optimization Modelling and Simulation Computational methods fo...
Academic journal
Save to List
270

The fast cubic algorithm
Efim A. Galperin
Computers & Mathematics with Applications. 25:147-160

Computational Mathematic... Computational Theory and... Nonlinear programming global optimization Modelling and Simulation Computational methods fo...
Academic journal
Save to List
271

A Fully Polynomial-Time Approximation Algorithm for Computing a Stationary Point of the General Linear Complementarity Problem: A fully polynomial-time approximation algorithm for computing a stationary point of the general linear complementarity problem
YeYinyu
Mathematics of Operations Research. 18:334-345

polynomal-time algorithm potential reduction algo... Computational methods fo... polynomial-time approxim... 0211 other engineering a... 02 engineering and techn...
Academic journal
Save to List
272

Clustering heuristics for set covering
Renata Krystyna Kwatera ; Bruno Simeone
Annals of Operations Research. 43:295-308

Combinatorial optimizati... Edge subsets with specia... Computational methods fo... 0211 other engineering a... set covering heuristics Boolean programming
Academic journal
Save to List
273

Reverse Auction and the Solution of Inequality Constrained Assignment Problems: Reverse auction and the solution of inequality constrained assignment problems
David A. Castanon ; Dimitri P. Bertsekas ; Haralampos Tsaknakis
SIAM Journal on Optimization. 3:268-297

Combinatorial optimizati... 0211 other engineering a... assignment problems 02 engineering and techn... Programming involving gr... Auctions, bargaining, bi...
Academic journal
Save to List
274

ALPO: Another Linear Program Optimizer: ALPO: Another linear program optimizer
Robert J. Vanderbei
ORSA Journal on Computing. 5:134-146

Linear programming Computational methods fo... 0211 other engineering a... 0202 electrical engineer... one-phase primal-dual pa... 02 engineering and techn...
Academic journal
Save to List
275

A Globally and Superlinearly Convergent Algorithm for Convex Quadratic Programs with Simple Bbounds: A globally and superlinearly convergent algorithm for convex quadratic programs with simple bounds
Thomas F. Coleman ; Laurie A. Hulbert
SIAM Journal on Optimization. 3:298-321

Convex programming optimality conditions interior point methods 0211 other engineering a... unconstrained piecewise... parallel computers
Academic journal
Save to List
276

An Algorithm for the Design of Multitype Concentrator Networks: An algorithm for the design of multitype concentrator networks
Choong Y. Lee
Journal of the Operational Research Society. 44:471-482

Discrete location and as... 0508 media and communica... concentrator location pr... Benders decomposition Communication networks i... Computational methods fo...
Academic journal
Save to List
277

A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops: A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops
Yeong-Dae Kim
Computers & Operations Research. 20:391-401

lower bounds Deterministic scheduling... two-machine flowshop sch... branch and bound Computational methods fo... 0211 other engineering a...
Academic journal
Save to List
278

Paroid search: generic local combinatorial optimization: Paroid search: Generic local combinatorial optimization
Ronald L. Rardin ; Moises Sudit
Discrete Applied Mathematics. 43:155-174

Combinatorial optimizati... Analysis of algorithms a... Applied Mathematics 0211 other engineering a... paroid struture 0102 computer and inform...
Academic journal
Save to List
279

Large-Step Interior Point Algorithms for Linear Complementarity Problems: Large-step interior point algorithms for linear complementarity problems
M. Kojima ; Y. Kurita ; S. Mizuno
SIAM Journal on Optimization. 3:398-412

primal-dual interior poi... step length rules Linear programming 4. Education Computational methods fo... 0211 other engineering a...
Academic journal
Save to List
280

A Lower Bound on the Expected Cost of an Optimal Assignment: A lower bound on the expected cost of an optimal assignment
Muralidharan S. Kodialam ; Michel X. Goemans
Mathematics of Operations Research. 18:267-274

Linear programming Computational methods fo... 0211 other engineering a... optimal assignment 0102 computer and inform... 02 engineering and techn...
Academic journal
Save to List

Filter