FICO Xpress is the premier mathematical modeling and optimization software suite in the world, with the best tools available to aid the development and deployment of optimization applications that solve real-world challenges. FICO Xpress helps organizations solve bigger problems, design applications faster and make even better decisions in virtually any business scenario. Xpress Optimization Suite includes two types of tools: model building and development tools, and solver engines.

References in zbMATH (referenced in 230 articles , 1 standard article )

Showing results 201 to 220 of 230.
Sorted by year (citations)

previous 1 2 3 ... 9 10 11 12 next

  1. Gould, Nick; Orban, Dominique; Toint, Philippe: Numerical methods for large-scale nonlinear optimization (2005)
  2. Kallrath, Josef: Solving planning and design problems in the process industry using mixed integer and global optimization (2005)
  3. Lucena, Abilio: Non delayed relax-and-cut algorithms (2005)
  4. Nwana, V.; Darby-Dowman, K.; Mitra, G.: A co-operative parallel heuristic for mixed zero--one linear programming: Combining simulated annealing with branch and bound (2005)
  5. Vazacopoulos, Alkis; Verma, Nitin: Hybrid MIP-CP techniques to solve a multi-machine assignment and scheduling problem in Xpress-CP (2005)
  6. Aron, Ionuţ; Hooker, John N.; Yunes, Tallys H.: SIMPL: A system for integrating optimization techniques (2004)
  7. Avella, Pasquale; Boccia, Maurizio; Sforza, Antonio: Solving a fuel delivery problem by heuristic and exact approaches. (2004)
  8. Kallrath, Josef: Exact computation of global minima of a nonconvex portfolio optimization problem (2004)
  9. Nielsen, C. A.; Armacost, A. P.; Barnhart, C.; Kolitz, S. E.: Network design formulations for scheduling U.S. air force channel route missions (2004)
  10. Roll, Jacob; Bemporad, Alberto; Ljung, Lennart: Identification of piecewise affine systems via mixed-integer programming. (2004)
  11. Bonates, Tibérius; Maculan, Nelson: Performance evaluation of a family of criss-cross algorithms for linear programming. (2003)
  12. Loparic, Marko; Marchand, Hugues; Wolsey, Laurence A.: Dynamic knapsack sets and capacitated lot-sizing (2003)
  13. Miller, Andrew J.; Wolsey, Laurence A.: Tight MIP formulation for multi-item discrete lot-sizing problems (2003)
  14. Walmsley, N. S.; Hearn, P.: An application of linear programming in the defence environment (2003)
  15. Avella, Pascale; Boccia, Mauricio; Sforza, Antonio: A penalty function heuristic for the resource constrained shortest path problem (2002)
  16. Georgiou, A. C.; Tsantas, N.: Modelling recruitment training in mathematical human resource planning (2002)
  17. Hajidimitriou, Yannis A.; Georgiou, Andreas C.: A goal programming model for partner selection decisions in international joint ventures (2002)
  18. Wolsey, Laurence A.: Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation (2002)
  19. Chen, Qun; Ferris, Michael C.; Linderoth, Jeff: FATCOP 2.0: Advanced features in an opportunistic mixed integer programming solver (2001)
  20. Tebboth, James; Daniel, Robert: A tightly integrated modelling and optimisation library: A new framework for rapid algorithm development (2001)

previous 1 2 3 ... 9 10 11 12 next