References in zbMATH (referenced in 14 articles )

Showing results 1 to 14 of 14.
Sorted by year (citations)

  1. Yang, Lingjian; Silva, Jonathan C.; Papageorgiou, Lazaros G.; Tsoka, Sophia: Community structure detection for directed networks through modularity optimisation (2016)
  2. Berthold, Timo: RENS. The optimal rounding (2014)
  3. Berthold, Timo; Gleixner, Ambros M.: Undercover: a primal MINLP heuristic exploring a largest sub-MIP (2014)
  4. Bonami, Pierre; Olivares, Alberto; Staffetti, Ernesto: Energy-optimal multi-goal motion planning for planar robot manipulators (2014)
  5. Hamzeei, Mahdi; Luedtke, James: Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation (2014)
  6. Bonami, Pierre; Kilinç, Mustafa; Linderoth, Jeff: Algorithms and software for convex mixed integer nonlinear programs (2012)
  7. Çakır, Ozan; Wesolowsky, George O.: Planar expropriation problem with non-rigid rectangular facilities (2011)
  8. D’Ambrosio, Claudia; Lodi, Andrea: Mixed integer nonlinear programming tools: a practical overview (2011)
  9. Liberti, Leo; Mladenović, Nenad; Nannicini, Giacomo: A recipe for finding good solutions to MINLPs (2011)
  10. Murray, Walter; Ng, Kien-Ming: An algorithm for nonlinear optimization problems with binary variables (2010)
  11. Bonami, Pierre; Biegler, Lorenz T.; Conn, Andrew R.; Cornuéjols, Gérard; Grossmann, Ignacio E.; Laird, Carl D.; Lee, Jon; Lodi, Andrea; Margot, François; Sawaya, Nicolas; Wächter, Andreas: An algorithmic framework for convex mixed integer nonlinear programs (2008)
  12. Pan, Shaohua; Tan, Tao; Jiang, Yuxi: A global continuation algorithm for solving binary quadratic programming problems (2008)
  13. Kallrath, Josef: Exact computation of global minima of a nonconvex portfolio optimization problem (2004)
  14. Goux, J.-P.; Leyffer, S.: Solving large MINLPs on computational grids (2002)