Menu
  • About & Contact
  • Feedback
  • Contribute
  • Help
  • zbMATH

swMATH

swmath-logo
  • Search
  • Advanced search
  • Browse
  • browse software by name
  • browse software by keywords
  • browse software by MSC
  • browse software by types

MacMINLP

MacMINLP: AMPL collection of mixed integer nonlinear programs.

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

  • mixed integer nonlinear programming
  • mixed-integer nonlinear programming
  • branch and bound
  • oracle penalty method
  • quasiconvex function
  • symmetry
  • outer approximation
  • computational grid
  • hybrid metaheuristics
  • cutting plane algorithms
  • MINLP
  • strong-branching
  • constrained optimization
  • global optimization
  • group
  • disjunctive programming
  • cutting planes
  • auxiliary function
  • local search
  • ant colony optimization
  • convex programming
  • extended formulations
  • nonconvex mixed-integer nonlinear programming
  • parallel branch-and-bound
  • lift-and-project
  • mixing inequalities
  • disjunctive inequalities
  • metacomputing
  • lift-and-project cuts

  • URL: wiki.mcs.anl.gov/leyff...
  • InternetArchive
  • Authors: S. Leyffer

  • Add information on this software.


  • Related software:
  • MINLPLib
  • filterSQP
  • BARON
  • FilMINT
  • LogMIP
  • CMU-IBM
  • AlphaECP
  • CPLEX
  • Bonmin
  • AMPL
  • Show more...
  • MISQP
  • Ipopt
  • minlpBB
  • SBB
  • MINTO
  • GAMS
  • MINLP
  • FATCOP
  • HTCondor MW
  • Concorde
  • Show less...

References in zbMATH (referenced in 10 articles )

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

  1. Kılınç, Mustafa R.; Linderoth, Jeff; Luedtke, James: Lift-and-project cuts for convex mixed integer nonlinear programs (2017)
  2. Hamzeei, Mahdi; Luedtke, James: Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation (2014)
  3. Kılınç, Mustafa; Linderoth, Jeff; Luedtke, James; Miller, Andrew: Strong-branching inequalities for convex mixed integer nonlinear programs (2014)
  4. Liberti, Leo: Reformulations in mathematical programming: automatic symmetry detection and exploitation (2012)
  5. Bonami, Pierre: Lift-and-project cuts for mixed integer convex programs (2011)
  6. Zhu, Wenxing; Lin, Geng: A dynamic convexized method for nonconvex mixed integer nonlinear programming (2011)
  7. Schlüter, Martin; Egea, Jose A.; Banga, Julio R.: Extended ant colony optimization for non-convex mixed integer nonlinear programming (2009)
  8. Srivastava, Vijaya K.; Fahim, Atef: An optimization method for solving mixed discrete-continuous programming problems (2007)
  9. Still, Claus; Westerlund, Tapio: Solving convex MINLP optimization problems using a sequential cutting plane algorithm (2006)
  10. Goux, J.-P.; Leyffer, S.: Solving large MINLPs on computational grids (2002)


Further publications can be found at: http://wiki.mcs.anl.gov/leyffer/index.php/Sven_Leyffer%27s_Publications
  • Article statistics & filter:

  • Search for articles
  • MSC classification / top
    • Top MSC classes
      • 90 Optimization

  • Publication year
    • 2010 - today
    • 2005 - 2009
    • 2000 - 2004
    • before 2000

  • Chart: cumulative / absolute
  • Terms & Conditions
  • Imprint
  • Privacy Policy