Browse Title Index

Issue Title
Vol 2, No 1 (2007) “Binarize and Project” to generate cuts for general mixed-integer programs Abstract   PDF
Jean-Sébastien Roy
Vol 7, No 1 (2012) O(m) Bound on Number of Iterations in Sphere Methods for LP Abstract   PDF
Katta G. Murty
Vol 4, No 2 (2009) 2-Commodity Integer Network Synthesis Problem Abstract   PDF
S. N. Kabadi, R. Chandrasekaran, K. P.K. Nair
Vol 3, No 2 (2008) A Combinatorial Optimization Approach for Determining Composition and Sequence of Polymers Abstract   PDF
Renato Bruni
Vol 7, No 2 (2012) A full-Newton step infeasible interior-point algorithm for linear complementarity problems based on a kernel function Abstract   PDF
B. Kheirfam
Vol 7, No 2 (2012) A Network Flow Model for Irrigation Water Management Abstract   PDF
A. L. N. Murthy, G. S. R. Murthy
Vol 1, No 1 (2006) A New Practically Efficient Interior Point Method for LP Abstract   PDF
Katta G Murty
Vol 4, No 1 (2009) A Solution Approach for Two-Stage Stochastic Nonlinear Mixed Integer Programs Abstract   PDF
Maria Elena Bruni, Patrizia Beraldi, Domenico Conforti
Vol 4, No 2 (2009) A Two-Period Portfolio Selection Model for Asset-backed Securitization Abstract   PDF
Renata Mansini, Ulrich Pferschy
Vol 7, No 2 (2012) A two-phase method for bi-objective combinatorial optimization and its application to the TSP with profits Abstract   PDF
Carlo Filippi, Elisa Stevanato
Vol 2, No 2 (2007) Alternative Decomposition Based Approaches for Assigning Dusjunctive Tasks Abstract   PDF
Salim Haddadi, Omar Slimani
Vol 7, No 1 (2012) An Efficient Hybrid Ant Colony System for the Generalized Traveling Salesman Problem Abstract   PDF
Daniel Karapetyan, Mohammad Reihaneh
Vol 3, No 2 (2008) An Exact Mathematical Programming Approach to Multiple RNA Sequence-Structure Alignment Abstract   PDF
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   PDF
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   PDF
Eric Angel, Romain Campigotto, Christian Laforest
Vol 4, No 2 (2009) Approximable 1-Turn Routing Problems in All-Optical Mesh Networks Abstract   PDF
Jérôme Palaysi, Olivier Cogis, Guillaume Bagan
Vol 4, No 1 (2009) Approximated MLC shape matrix decomposition with interleaf collision constraint Abstract   PDF
Thomas Kalinowski, Antje Kiesel
Vol 5, No 1 (2010) Approximating the metric 2-Peripatetic Salesman Problem Abstract   PDF
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   PDF
Antje Kiesel, Céline Engelbeen
Vol 2, No 2 (2007) Branch-and-Cut Algorithms for Winner Determination in Discount Auctions Abstract   PDF
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   PDF
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   PDF
Peter Broström, Kaj Holmberg
Vol 7, No 2 (2012) Complementarity Problems And Positive Definite Matrices Abstract   PDF
P. Bhimashankaram, T. Parthasarathy, A. L. N. Murthy, G. S. R. Murthy
Vol 5, No 2 (2010) Computing general static-arbitrage bounds for European basket options via Dantzig-Wolfe decomposition Abstract   PDF
Javier Peña, Xavier Saynac, Juan C. Vera, Luis Fernando Zuluaga
Vol 1, No 2 (2006) Constructing Incremental Sequences in Graphs Abstract   PDF
Ralf Klasing, Christian Laforest, Joseph Peters, Nicolas Thibault
1 - 25 of 94 Items 1 2 3 4 > >>