default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithmic Operations Research, Volume 7
Volume 7, Number 1, 2012
- Gilles Simonin, Rodolphe Giroudeau, Benoît Darties, Jean-Claude König:
Theoretical aspects of scheduling coupled-tasks in the presence of compatibility graph. 1-12 - Lars Magnus Hvattum, Arne Løkketangen, Fred W. Glover:
Comparisons of Commercial MIP Solvers and an Adaptive Memory (Tabu Search) Procedure for a Class of 0-1 Integer Programming Problems. 13-20 - Daniel Karapetyan, Mohammad Reihaneh:
An Efficient Hybrid Ant Colony System for the Generalized Traveling Salesman Problem. 22-29 - Katta G. Murty:
O(m) Bound on Number of Iterations in Sphere Methods for LP. 30-40 - Wei Ding:
The makespan problem of scheduling multi groups of jobs on multi processors at different speeds. 41-50
Volume 7, Number 2, 2012
- Katta G. Murty:
Fast Descent Methods for LPs With No Matrix Inversions. - Bodhibrata Nag, Katta G. Murty:
Organizing National Elections in India to Elect the 543 Members of the Lok Sabha. - G. S. R. Murthy, D. K. Manna:
Optimization in 2m 3n Factorial Experiments. - A. L. N. Murthy, G. S. R. Murthy:
A Network Flow Model for Irrigation Water Management. - P. Bhimashankaram, T. Parthasarathy, A. L. N. Murthy, G. S. R. Murthy:
Complementarity Problems And Positive Definite Matrices. - Behrouz Kheirfam:
A full-Newton step infeasible interior-point algorithm for linear complementarity problems based on a kernel function. - Laurent Gourvès, Jérôme Monnot, Fanny Pascual:
Cooperation in multiorganization matching. - Carlo Filippi, Elisa Stevanato:
A two-phase method for bi-objective combinatorial optimization and its application to the TSP with profits.
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-30 19:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
