Search Results

There are 45964 results for: content related to: Molecular distance geometry methods: from continuous to discrete

  1. On the Chvátal rank of linear relaxations of the stable set polytope

    International Transactions in Operational Research

    Volume 17, Issue 6, November 2010, Pages: 827–849, Eugenia Holm, Luis M. Torres and Annegret K. Wagler

    Version of Record online : 24 SEP 2010, DOI: 10.1111/j.1475-3995.2009.00744.x

  2. Block-iterative algorithms

    International Transactions in Operational Research

    Volume 16, Issue 4, July 2009, Pages: 427–463, Charles Byrne

    Version of Record online : 16 FEB 2009, DOI: 10.1111/j.1475-3995.2008.00683.x

  3. Polyhedral studies for minimum-span graph labelling with integer distance constraints

    International Transactions in Operational Research

    Volume 14, Issue 2, March 2007, Pages: 105–121, Vicky Mak

    Version of Record online : 20 FEB 2007, DOI: 10.1111/j.1475-3995.2007.00577.x

  4. Solving the irregular strip packing problem via guided local search for overlap minimization

    International Transactions in Operational Research

    Volume 16, Issue 6, November 2009, Pages: 661–683, Shunji Umetani, Mutsunori Yagiura, Shinji Imahori, Takashi Imamichi, Koji Nonobe and Toshihide Ibaraki

    Version of Record online : 3 JUN 2009, DOI: 10.1111/j.1475-3995.2009.00707.x

  5. Robust routing and optimal partitioning of a traffic demand polytope

    International Transactions in Operational Research

    Volume 18, Issue 3, May 2011, Pages: 307–333, Walid Ben-Ameur and Mateusz Żotkiewicz

    Version of Record online : 12 AUG 2010, DOI: 10.1111/j.1475-3995.2010.00764.x

  6. Sensitivity analysis on the all pairs q-route flows in a network

    International Transactions in Operational Research

    Volume 17, Issue 1, January 2010, Pages: 103–117, Madiagne Diallo, Serigne Gueye and Pascal Berthomé

    Version of Record online : 3 JUN 2009, DOI: 10.1111/j.1475-3995.2009.00698.x

  7. Discrete–continuous analysis of optimal equipment replacement

    International Transactions in Operational Research

    Volume 17, Issue 5, September 2010, Pages: 577–593, Yuri Yatsenko and Natali Hritonenko

    Version of Record online : 11 FEB 2010, DOI: 10.1111/j.1475-3995.2009.00747.x

  8. Implicit regularization of the incomplete oblique projections method

    International Transactions in Operational Research

    Volume 16, Issue 4, July 2009, Pages: 525–546, H. D. Scolnik, N. E. Echebest and M. T. Guardarucci

    Version of Record online : 24 APR 2009, DOI: 10.1111/j.1475-3995.2009.00694.x

  9. Sensitivity analysis of the knapsack sharing problem: perturbation of the profit of an item

    International Transactions in Operational Research

    Volume 15, Issue 1, January 2008, Pages: 35–49, T. Belgacem and M. Hifi

    Version of Record online : 2 JAN 2008, DOI: 10.1111/j.1475-3995.2007.00619.x

  10. Optimizing channel profits with threshold incentives and alternative pricing schemes

    International Transactions in Operational Research

    Volume 18, Issue 5, September 2011, Pages: 617–646, Ozgun Caliskan Demirag

    Version of Record online : 22 JUN 2011, DOI: 10.1111/j.1475-3995.2011.00820.x

  11. Characterizing arbitrarily slow convergence in the method of alternating projections

    International Transactions in Operational Research

    Volume 16, Issue 4, July 2009, Pages: 413–425, Heinz H. Bauschke, Frank Deutsch and Hein Hundal

    Version of Record online : 11 FEB 2009, DOI: 10.1111/j.1475-3995.2008.00682.x

  12. A production-inventory model under stock-dependent demand, Weibull distribution deterioration and shortage

    International Transactions in Operational Research

    Volume 16, Issue 3, May 2009, Pages: 325–346, T. Roy and K. S. Chaudhuri

    Version of Record online : 16 FEB 2009, DOI: 10.1111/j.1475-3995.2008.00676.x

  13. Packing identical spheres into a cylinder

    International Transactions in Operational Research

    Volume 17, Issue 1, January 2010, Pages: 51–70, Yu. G. Stoyan and G. N. Yaskov

    Version of Record online : 22 DEC 2009, DOI: 10.1111/j.1475-3995.2009.00733.x

  14. A threat–response multi-criteria funding model for homeland security grant programs

    International Transactions in Operational Research

    Volume 14, Issue 4, July 2007, Pages: 267–290, Madjid Tavana

    Version of Record online : 12 JUN 2007, DOI: 10.1111/j.1475-3995.2007.00587.x

  15. Markov decision processes with a target set for minimum criteria

    International Transactions in Operational Research

    Volume 14, Issue 6, November 2007, Pages: 509–520, Yoshio Ohtsubo

    Version of Record online : 9 OCT 2007, DOI: 10.1111/j.1475-3995.2007.00610.x

  16. Complexity results for identifying codes in planar graphs

    International Transactions in Operational Research

    Volume 17, Issue 6, November 2010, Pages: 691–710, David Auger, Irène Charon, Olivier Hudry and Antoine Lobstein

    Version of Record online : 18 AUG 2010, DOI: 10.1111/j.1475-3995.2009.00750.x

  17. Solving scalarized multi-objective network flow problems using an interior point method

    International Transactions in Operational Research

    Volume 17, Issue 5, September 2010, Pages: 607–636, Margarida Fonseca, José Rui Figueira and Mauricio G.C. Resende

    Version of Record online : 29 JUN 2010, DOI: 10.1111/j.1475-3995.2010.00761.x

  18. One-dimensional relaxations and LP bounds for orthogonal packing

    International Transactions in Operational Research

    Volume 16, Issue 6, November 2009, Pages: 745–766, G. Belov, V. Kartak, H. Rohling and G. Scheithauer

    Version of Record online : 7 AUG 2009, DOI: 10.1111/j.1475-3995.2009.00713.x

  19. Incomplete oblique projections method for solving regularized least-squares problems in image reconstruction

    International Transactions in Operational Research

    Volume 15, Issue 4, July 2008, Pages: 417–438, H. D. Scolnik, N. E. Echebest and M. T. Guardarucci

    Version of Record online : 28 JUN 2008, DOI: 10.1111/j.1475-3995.2008.00643.x

  20. You have free access to this content
    The pure parsimony haplotyping problem: overview and computational advances

    International Transactions in Operational Research

    Volume 16, Issue 5, September 2009, Pages: 561–584, Daniele Catanzaro and Martine Labbé

    Version of Record online : 1 JUL 2009, DOI: 10.1111/j.1475-3995.2009.00716.x