Cited in
(only showing first 100 items - show all)- Generalized local branching heuristics and the capacitated ring tree problem
- Irreducible infeasible sets in convex mixed-integer programs
- On the strength of Gomory mixed-integer cuts as group cuts
- Inexact feasibility pump for mixed integer nonlinear programming
- Generation of feasible integer solutions on a massively parallel computer using the feasibility pump
- Modeling and solving the mixed capacitated general routing problem
- Rounding-based heuristics for nonconvex MINLPS
- Static analysis by abstract interpretation: a mathematical programming approach
- Performance criteria for optimization of cardiac assistance
- Penalty alternating direction methods for mixed-integer optimization: a new view on feasibility pumps
- Two-step MIR inequalities for mixed integer programs
- A recipe for finding good solutions to MINLPs
- Three ideas for a feasibility pump for nonconvex MINLP
- Boosting the feasibility pump
- A heuristic approach for big bucket multi-level production planning problems
- Continuous reformulations for zero-one programming problems
- Mixed integer nonlinear programming tools: an updated practical overview
- Hybrid heuristics for a short sea inventory routing problem
- Mixed integer nonlinear programming tools: a practical overview
- Restrict-and-relax search for 0-1 mixed-integer programs
- HOPS -- Hamming-Oriented Partition Search for production planning in the spinning industry
- The supporting hyperplane optimization toolkit for convex MINLP
- A disjunctive cut strengthening technique for convex MINLP
- Combinatorial integral approximation
- Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs
- A computational study of primal heuristics inside an MI(NL)P solver
- A primal heuristic for optimizing the topology of gas networks based on dual information
- ZI round, a MIP rounding heuristic
- Active-constraint variable ordering for faster feasibility of mixed integer linear programs
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- Integer Programming
- Decomposition, reformulation, and diving in university course timetabling
- A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times
- Point-to-point shortest paths on dynamic time-dependent road networks
- Feasibility pump for aircraft deconfliction with speed regulation
- Integrality gap minimization heuristics for binary mixed integer nonlinear programming
- Preface to the special issue ``GOW'16
- A system to evaluate gas network capacities: concepts and implementation
- Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation
- A feasible rounding approach for mixed-integer optimization problems
- Solving hard mixed-integer programming problems with Xpress-MP: a MIPLIB 2003 case study
- MindtPy
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Variable neighbourhood pump heuristic for 0-1 mixed integer programming feasibility
- A computational study of parametric tabu search for 0-1 mixed integer programs
- Inexact solution of NLP subproblems in MINLP
- Shift-and-propagate
- RENS. The optimal rounding
- Fix-and-relax approaches for controlled tabular adjustment
- Modeling and solving a bi-objective airport slot scheduling problem
- Cut generation for an integrated employee timetabling and production scheduling problem
- An exact algorithm for biobjective mixed integer linear programming problems
- Undercover: a primal MINLP heuristic exploring a largest sub-MIP
- Faster integer-feasibility in mixed-integer linear programs by branching to force change
- An interior point cutting plane heuristic for mixed integer programming
- Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
- Repairing MIP infeasibility through local branching
- Improving Benders decomposition using a genetic algorithm
- Column generation based primal heuristics
- Integer-programming software systems
- Heuristics for convex mixed integer nonlinear programs
- A new class of functions for measuring solution integrality in the feasibility pump approach
- Feasibility pump 2.0
- A relax-and-cut framework for Gomory mixed-integer cuts
- The feasibility pump
- FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- Heuristics of the branch-cut-and-price-framework SCIP
- Feasibility and infeasibility in optimization. Algorithms and computational methods.
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
- GLOB
- SNDlib
- SCIP
- LaGO
- RAMP
- MIPLIB
- SoPlex
- Zimpl
- 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
This page was built for software: FEASPUMP
