New answers tagged reference-request
0
votes
Complexity of the ellipsoid method in general convex problems
The following links refers to application of ellipsoidal algorithms with some variations to NLPs:
Paper by Drs. Rugenstein. E & Kupferschimd.M: presents results showing convergence by ellipsoidal ...
1
vote
Optimization algorithm for space debris
ACO, genetic algorithms and other metaheuristics can be adapted to constrained problems by adding to the objective function penalties for constraint violations and then treating the problem as ...
Top 50 recent answers are included
Related Tags
reference-request × 198optimization × 48
mixed-integer-programming × 28
linear-programming × 23
integer-programming × 16
scheduling × 14
vehicle-routing × 14
modeling × 12
applications × 12
books × 11
graphs × 10
heuristics × 9
benders-decomposition × 9
solver × 8
computational-complexity × 8
network-flow × 8
literature-research × 8
nonlinear-programming × 6
algorithms × 6
traveling-salesman × 6
combinatorial-optimization × 5
convex-optimization × 5
stochastic-programming × 5
queuing-theory × 5
set-covering × 5