FEASPUMP

swMATH4802MaRDI QIDQ16964FDOQ16964

Author name not available (Why is that?)

Official website: http://www.or.deis.unibo.it/research_pages/ORcodes/FP-gen.html

Cited In (only showing first 100 items - show all)

• Solving linear programs with complementarity constraints using branch-and-cut
• Towards an objective feasibility pump for convex minlps
• Improving branch-and-cut performance by random sampling
• FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming
• Using the analytic center in the feasibility pump
• Heuristics for convex mixed integer nonlinear programs
• FilMINT: an outer approximation-based solver for convex mixed-integer nonlinear programs
• Improving Benders decomposition using a genetic algorithm
• A feasibility pump for mixed integer nonlinear programs
• Feasibility pump 2.0
• Integer-programming software systems
• Proximity search for 0--1 mixed-integer convex programming
• The group-theoretic approach in mixed integer programming
• Polylithic modeling and solution approaches using algebraic modeling systems
• A storm of feasibility pumps for nonconvex MINLP
• Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
• Achieving MILP feasibility quickly using general disjunctions
• MIP formulations and heuristics for two-level production-transportation problems
• Recursive central rounding for mixed integer programs
• An exact algorithm for biobjective mixed integer linear programming problems
• Modeling and solving the mixed capacitated general routing problem
• An interior point cutting plane heuristic for mixed integer programming
• GLOB
• SCIP
• Cbc
• Benchmarks for Optimization Software
• COIN-OR
• Bonmin
• MINLP
• AlphaECP
• DICOPT
• MINOPT
• CLP
• LogMIP
• MIPTS
• XPRESS
• BQPD
• FilMINT
• MINLPLib
• mkc7
• LINDOGlobal
• minlpBB
• MINOTAUR
• SBB
• ParaSCIP
• Valse-XT
• An empirical evaluation of walk-and-round heuristics for mixed integer linear programs
• ROSE
• GLOPEQ
• MIPLIB2003
• CGLS
• Cgllandp
• FortMP
• PAVER
• DINS
• bc-prod
• CORAL
• MIRPLib
• COR@L
• MIQPlib
• SAP APO
• Decision tree for optimization software
• SHOT
• CuSPLIB
• MathProgBase
• A feasibility pump heuristic for general mixed-integer problems
• Improving the feasibility pump
• The feasibility pump
• CBMix
• MULTILSB
• Octane
• iOptimize
• Lamatto++
• POPMUSIC
• BPPLIB
• Juniper
• CherryPy
• FPBH.jl
• IPET
• Decogo
• weightedHypervolume
• Muriqui
• SUSPECT
• Pajarito
• DIETER
• PortLib
• A new class of functions for measuring solution integrality in the feasibility pump approach
• Algorithms and Software for Convex Mixed Integer Nonlinear Programs
• Decomposition, reformulation, and diving in university course timetabling
• SCIP: solving constraint integer programs
• A relax-and-cut framework for Gomory mixed-integer cuts
• Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization
• Generalized local branching heuristics and the capacitated ring tree problem
• Rounding-based heuristics for nonconvex MINLPS
• Feasibility and infeasibility in optimization. Algorithms and computational methods.
• Heuristics of the branch-cut-and-price-framework SCIP
• Column generation based primal heuristics
• A New Approach to the Feasibility Pump in Mixed Integer Programming
• Hybrid heuristics for a short sea inventory routing problem
• Mixed integer nonlinear programming tools: a practical overview

This page was built for software: FEASPUMP