| Issue | Title | |
| Vol 4, No 2 (2009) | 2-Commodity Integer Network Synthesis Problem | Abstract |
| S. N. Kabadi, R. Chandrasekaran, K. P.K. Nair | ||
| Vol 7, No 1 (2012) | O(m) Bound on Number of Iterations in Sphere Methods for LP | Abstract |
| Katta G. Murty | ||
| Vol 3, No 2 (2008) | A Combinatorial Optimization Approach for Determining Composition and Sequence of Polymers | Abstract |
| Renato Bruni | ||
| Vol 1, No 1 (2006) | A New Practically Efficient Interior Point Method for LP | Abstract |
| Katta G Murty | ||
| Vol 4, No 1 (2009) | A Solution Approach for Two-Stage Stochastic Nonlinear Mixed Integer Programs | Abstract |
| Maria Elena Bruni, Patrizia Beraldi, Domenico Conforti | ||
| Vol 4, No 2 (2009) | A Two-Period Portfolio Selection Model for Asset-backed Securitization | Abstract |
| Renata Mansini, Ulrich Pferschy | ||
| Vol 2, No 2 (2007) | Alternative Decomposition Based Approaches for Assigning Dusjunctive Tasks | Abstract |
| Salim Haddadi, Omar Slimani | ||
| Vol 7, No 1 (2012) | An Efficient Hybrid Ant Colony System for the Generalized Traveling Salesman Problem | Abstract |
| Daniel Karapetyan, Mohammad Reihaneh | ||
| Vol 3, No 2 (2008) | An Exact Mathematical Programming Approach to Multiple RNA Sequence-Structure Alignment | Abstract |
| Markus Bauer, Gunnar W. Klau, Knut Reinert | ||
| Vol 5, No 1 (2010) | An improved LS algorithm for the problem of scheduling multi groups of jobs on multi processors at the same speed | Abstract |
| Wei Ding, Yi Zhao | ||
| Vol 6, No 1 (2011) | Analysis and Comparison of Three Algorithms for the Vertex Cover Problem on Large Graphs with Low Memory Capacities | Abstract |
| Eric Angel, Romain Campigotto, Christian Laforest | ||
| Vol 4, No 2 (2009) | Approximable 1-Turn Routing Problems in All-Optical Mesh Networks | Abstract |
| Jérôme Palaysi, Olivier Cogis, Guillaume Bagan | ||
| Vol 4, No 1 (2009) | Approximated MLC shape matrix decomposition with interleaf collision constraint | Abstract |
| Thomas Kalinowski, Antje Kiesel | ||
| Vol 5, No 1 (2010) | Approximating the metric 2-Peripatetic Salesman Problem | Abstract |
| Federico Della Croce, Vangelis Th. Paschos, Roberto Wolfler Calvo | ||
| Vol 5, No 2 (2010) | Binary matrix decompositions without tongue-and-groove underdosage for radiation therapy planning | Abstract |
| Antje Kiesel, Céline Engelbeen | ||
| Vol 2, No 2 (2007) | Branch-and-Cut Algorithms for Winner Determination in Discount Auctions | Abstract |
| Sampath Kameshwaran, Lyes Benyoucef, Xiaolan Xie | ||
| Vol 7, No 1 (2012) | Comparisons of Commercial MIP Solvers and an Adaptive Memory (Tabu Search) Procedure for a Class of 0-1 Integer Programming Problems | Abstract |
| Lars Magnus Hvattum, Arne Løkketangen, Fred Glover | ||
| Vol 4, No 1 (2009) | Compatible Weights and Valid Cycles in Non-spanning OSPF Routing Patterns | Abstract |
| Peter Broström, Kaj Holmberg | ||
| Vol 5, No 2 (2010) | Computing general static-arbitrage bounds for European basket options via Dantzig-Wolfe decomposition | Abstract |
| Javier Peña, Xavier Saynac, Juan C. Vera, Luis Fernando Zuluaga | ||
| Vol 1, No 2 (2006) | Constructing Incremental Sequences in Graphs | Abstract |
| Ralf Klasing, Christian Laforest, Joseph Peters, Nicolas Thibault | ||
| Vol 3, No 2 (2008) | Discovering Trends in Gene Expression Data Using a Hybrid Evolutionary Algorithm | Abstract |
| Stefan Bleuler, Philip Zimmermann, Markus Friberg, Eckart Zitzler | ||
| Vol 6, No 2 (2011) | Experimental Analysis of the MRF Algorithm for Segmentation of Noisy Medical Images | Abstract |
| Joe Qranfal, Dorit S. Hochbaum, Germain Tanoh | ||
| Vol 4, No 2 (2009) | From Balls and Bins to Points and Vertices | Abstract |
| Ralf Klasing, Zvi Lotker, Alfredo Navarra, Stéphane Pérennes | ||
| Vol 4, No 1 (2009) | General Form of Nonmonotone Line Search Techniques For Unconstrained Optimization | Abstract |
| Zhensheng Yu, Ji Lin | ||
| Vol 4, No 2 (2009) | Generalized Traveling Salesman Problem Reduction Algorithms | Abstract |
| Gregory Gutin, Daniel Karapetyan | ||
| 1 - 25 of 86 Items | 1 2 3 4 > >> | |
Algorithmic Operations Research. ISSN: 1718-3235