Login / Signup
Algorithmic Oper. Res.
2006
2009
2012
2006
2012
Keyphrases
Publications
volume 7, number 1, 2012
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.
Algorithmic Oper. Res.
7 (1) (2012)
Wei Ding
The makespan problem of scheduling multi groups of jobs on multi processors at different speeds.
Algorithmic Oper. Res.
7 (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.
Algorithmic Oper. Res.
7 (1) (2012)
Katta G. Murty
) Bound on Number of Iterations in Sphere Methods for LP.
Algorithmic Oper. Res.
7 (1) (2012)
Daniel Karapetyan
,
Mohammad Reihaneh
An Efficient Hybrid Ant Colony System for the Generalized Traveling Salesman Problem.
Algorithmic Oper. Res.
7 (1) (2012)
volume 7, number 2, 2012
Katta G. Murty
Fast Descent Methods for LPs With No Matrix Inversions.
Algorithmic Oper. Res.
7 (2) (2012)
Laurent Gourvès
,
Jérôme Monnot
,
Fanny Pascual
Cooperation in multiorganization matching.
Algorithmic Oper. Res.
7 (2) (2012)
G. S. R. Murthy
,
D. K. Manna
Factorial Experiments.
Algorithmic Oper. Res.
7 (2) (2012)
A. L. N. Murthy
,
G. S. R. Murthy
A Network Flow Model for Irrigation Water Management.
Algorithmic Oper. Res.
7 (2) (2012)
Bodhibrata Nag
,
Katta G. Murty
Organizing National Elections in India to Elect the 543 Members of the Lok Sabha.
Algorithmic Oper. Res.
7 (2) (2012)
Behrouz Kheirfam
A full-Newton step infeasible interior-point algorithm for linear complementarity problems based on a kernel function.
Algorithmic Oper. Res.
7 (2) (2012)
P. Bhimashankaram
,
T. Parthasarathy
,
A. L. N. Murthy
,
G. S. R. Murthy
Complementarity Problems And Positive Definite Matrices.
Algorithmic Oper. Res.
7 (2) (2012)
Carlo Filippi
,
Elisa Stevanato
A two-phase method for bi-objective combinatorial optimization and its application to the TSP with profits.
Algorithmic Oper. Res.
7 (2) (2012)
volume 6, number 1, 2011
Eric Angel
,
Romain Campigotto
,
Christian Laforest
Analysis and Comparison of Three Algorithms for the Vertex Cover Problem on Large Graphs with Low Memory Capacities.
Algorithmic Oper. Res.
6 (1) (2011)
Mahamed G. H. Omran
,
Fred W. Glover
The AID Method for Global Optimization.
Algorithmic Oper. Res.
6 (1) (2011)
Edward C. Sewell
,
Sheldon H. Jacobson
,
Hemanshu Kaul
Reductions for the Stable Set Problem.
Algorithmic Oper. Res.
6 (1) (2011)
Santosh N. Kabadi
,
Abraham P. Punnen
Trioid: A generalization of matroid and the associated polytope.
Algorithmic Oper. Res.
6 (1) (2011)
Christopher Kumar Anand
,
Stephen J. Stoyan
,
Tamás Terlaky
Optimizing the gVERSE RF Pulse Sequence: An Evaluation of Two Competitive Software Algorithms.
Algorithmic Oper. Res.
6 (1) (2011)
volume 6, number 2, 2011
Joe Qranfal
,
Dorit S. Hochbaum
,
Germain Tanoh
Experimental Analysis of the MRF Algorithm for Segmentation of Noisy Medical Images.
Algorithmic Oper. Res.
6 (2) (2011)
Roy H. Kwon
,
Stephen J. Stoyan
Mean-Absolute Deviation Portfolio Models with Discrete Choice Constraints.
Algorithmic Oper. Res.
6 (2) (2011)
Chefi Triki
,
Gianpaolo Ghiani
,
Roberto Musmanno
Probabilistic Model and Solution Algorithm for the Electricity Retailers in the Italian Market.
Algorithmic Oper. Res.
6 (2) (2011)
Lara Turner
Variants of Shortest Path Problems.
Algorithmic Oper. Res.
6 (2) (2011)
Fei Li
,
Zhi Zhang
Scheduling Weighted Packets with Deadlines over a Fading Channel.
Algorithmic Oper. Res.
6 (2) (2011)
volume 5, number 1, 2010
Katta G. Murty
,
Mohammad R. Oskoorouchi
Sphere Methods for LP.
Algorithmic Oper. Res.
5 (1) (2010)
Tibor Illés
,
Marianna Nagy
,
Tamás Terlaky
Polynomial Interior Point Algorithms for General Linear Complementarity Problems.
Algorithmic Oper. Res.
5 (1) (2010)
Seyed Ahmad Hosseini
,
Hassan Salehi Fathabadi
Minimum Cost Flow Problem on Dynamic Multi Generative Network flows.
Algorithmic Oper. Res.
5 (1) (2010)
Wei Ding
,
Yi Zhao
An improved LS algorithm for the problem of scheduling multi groups of jobs on multi processors at the same speed.
Algorithmic Oper. Res.
5 (1) (2010)
Cécile Murat
,
Vangelis Th. Paschos
Probabilistic optimization in graph-problems.
Algorithmic Oper. Res.
5 (1) (2010)
Federico Della Croce
,
Vangelis Th. Paschos
,
Roberto Wolfler Calvo
Approximating the metric 2-Peripatetic Salesman Problem.
Algorithmic Oper. Res.
5 (1) (2010)
volume 5, number 2, 2010
Nora Touati Moungla
,
Lucas Létocart
,
Anass Nagih
Solutions diversification in a column generation algorithm.
Algorithmic Oper. Res.
5 (2) (2010)
R. Chandrasekaran
Santosh Narayan Kabadi 1956-2010.
Algorithmic Oper. Res.
5 (2) (2010)
Martti Hamina
,
Matti Peltola
Some Structural Properties of a Least Central Subtree of a Tree.
Algorithmic Oper. Res.
5 (2) (2010)
Javier Peña
,
Xavier Saynac
,
Juan Carlos Vera
,
Luis Fernando Zuluaga
Computing general static-arbitrage bounds for European basket options via Dantzig-Wolfe decomposition.
Algorithmic Oper. Res.
5 (2) (2010)
Antje Kiesel
,
Céline Engelbeen
Binary matrix decompositions without tongue-and-groove underdosage for radiation therapy planning.
Algorithmic Oper. Res.
5 (2) (2010)
Brian C. Dean
Speeding up Stochastic Dynamic Programming with Zero-Delay Convolution.
Algorithmic Oper. Res.
5 (2) (2010)
François-Xavier Meuwly
,
Bernard Ries
,
Nicolas Zufferey
Solution Methods for a Scheduling Problem with Incompatibility and Precedence Constraints.
Algorithmic Oper. Res.
5 (2) (2010)