FEASPUMP
From MaRDI portal
Cited in
(only showing first 100 items - show all)- A feasibility pump for mixed integer nonlinear programs
- Cut generation for an integrated employee timetabling and production scheduling problem
- Decomposition, reformulation, and diving in university course timetabling
- Improving Benders decomposition using a genetic algorithm
- Feasibility pump 2.0
- Performance criteria for optimization of cardiac assistance
- GLOB
- MindtPy
- SNDlib
- SCIP
- LaGO
- RAMP
- SoPlex
- Zimpl
- MIPLIB
- The ring spur assignment problem: new formulation, valid inequalities and a branch-and-cut approach
- The green capacitated multi-item lot sizing problem with parallel machines
- MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration
- A variable MIP neighborhood descent algorithm for managing inventory and distribution of cash in automated Teller machines
- Redundancy system design for an aircraft door management system
- Cbc
- COIN-OR
- Benchmarks for Optimization Software
- Method for solving generalized convex nonsmooth mixed-integer nonlinear programming problems
- Bonmin
- Adaptive kernel search: a heuristic for solving mixed integer linear programs
- A hybrid primal heuristic for finding feasible solutions to mixed integer programs
- MINLP
- XPRESS
- Variable neighborhood search: basics and variants
- DICOPT
- MINOPT
- AlphaECP
- On the statistical evaluation of algorithmic's computational experimentation with infeasible solutions
- LogMIP
- MIPTS
- CLP
- Generation of feasible integer solutions on a massively parallel computer using the feasibility pump
- On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems
- Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials
- Computing feasible points for binary MINLPs with MPECs
- Generalized local branching heuristics and the capacitated ring tree problem
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- A multi-item approach to repairable stocking and expediting in a fluctuating demand environment
- The search-and-remove algorithm for biobjective mixed-integer linear programming problems
- MIP formulations and heuristics for two-level production-transportation problems
- A relax-and-cut framework for Gomory mixed-integer cuts
- Rounding-based heuristics for nonconvex MINLPS
- Rounding heuristics for multiple product dynamic lot-sizing in the presence of queueing behavior
- A dual heuristic for mixed integer programming
- mkc7
- MINLPLib
- LINDOGlobal
- FilMINT
- BQPD
- minlpBB
- Valse-XT
- SBB
- MINOTAUR
- ParaSCIP
- A storm of feasibility pumps for nonconvex MINLP
- Inexact solution of NLP subproblems in MINLP
- MIPLIB2003
- GLOPEQ
- ROSE
- CGLS
- A proximal-point outer approximation algorithm
- Coupling feasibility pump and large neighborhood search to solve the Steiner team orienteering problem
- Cgllandp
- On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs
- FortMP
- Alternative regularizations for outer-approximation algorithms for convex MINLP
- Generalized relax-and-fix heuristic
- PAVER
- Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT
- A disjunctive cut strengthening technique for convex MINLP
- Pyomo.GDP: an ecosystem for logic based modeling and optimization development
- Adaptive large neighborhood search for mixed integer programming
- The supporting hyperplane optimization toolkit for convex MINLP
- DINS
- Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation
- HOPS -- Hamming-Oriented Partition Search for production planning in the spinning industry
- A primal heuristic for optimizing the topology of gas networks based on dual information
- bc-prod
- Solving linear programs with complementarity constraints using branch-and-cut
- CORAL
- Structure-driven fix-and-propagate heuristics for mixed integer programming
- Feasibility pump algorithm for sparse representation under Laplacian noise
- Modeling and solving a bi-objective airport slot scheduling problem
- Granularity in nonlinear mixed-integer optimization
- MIRPLib
- Ten years of feasibility pump, and counting
- FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming
- On electricity market equilibria with storage: modeling, uniqueness, and a distributed ADMM
- An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs
- Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
- Three ideas for a feasibility pump for nonconvex MINLP
- Mixed integer nonlinear programming tools: an updated practical overview
- An empirical evaluation of walk-and-round heuristics for mixed integer linear programs
- Tighter MIP formulations for the discretised unit commitment problem with MIN-stop ramping constraints
This page was built for software: FEASPUMP
