FEASPUMP
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Inexact solution of NLP subproblems in MINLP
- Undercover: a primal MINLP heuristic exploring a largest sub-MIP
- A New Approach to the Feasibility Pump in Mixed Integer Programming
- Feasibility Pump-like heuristics for mixed integer problems
- Hybrid heuristics for a short sea inventory routing problem
- Mixed integer nonlinear programming tools: a practical overview
- 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
- Convex analysis in groups and semigroups: a sampler
- Towards an objective feasibility pump for convex minlps
- Improving branch-and-cut performance by random sampling
- Solving linear programs with complementarity constraints using branch-and-cut
- Repairing MIP infeasibility through local branching
- FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming
- Two-step MIR inequalities for mixed integer programs
- 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
- Using the analytic center in the feasibility pump
- Heuristics for convex mixed integer nonlinear programs
- Modeling and solving a bi-objective airport slot scheduling problem
- On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems
- Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
- Generalized relax-and-fix heuristic
- Performance criteria for optimization of cardiac assistance
- Mathematical programming based heuristics for the 0--1 MIP: a survey
- 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
- A feasible rounding approach for mixed-integer optimization problems
- The search-and-remove algorithm for biobjective mixed-integer linear programming problems
- Continuous reformulations for zero-one programming problems
- FilMINT: an outer approximation-based solver for convex mixed-integer nonlinear programs
- A partial outer convexification approach to control transmission lines
- A computational study of parametric tabu search for 0-1 mixed integer programs
- Improving Benders decomposition using a genetic algorithm
- An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs
- A feasibility pump for mixed integer nonlinear programs
- On the strength of Gomory mixed-integer cuts as group cuts
- Feasibility pump 2.0
- Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT
- Four Good Reasons to Use an Interior Point Solver Within a MIP Solver
- Integer-programming software systems
- Generation of feasible integer solutions on a massively parallel computer using the feasibility pump
- A simple effective heuristic for embedded mixed-integer quadratic programming
- A multi-item approach to repairable stocking and expediting in a fluctuating demand environment
- Variable neighbourhood pump heuristic for 0-1 mixed integer programming feasibility
- 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
- Pyomo.GDP: an ecosystem for logic based modeling and optimization development
- A proximal-point outer approximation algorithm
- Proximity search for 0--1 mixed-integer convex programming
- The group-theoretic approach in mixed integer programming
- Coupling feasibility pump and large neighborhood search to solve the Steiner team orienteering problem
- Polylithic modeling and solution approaches using algebraic modeling systems
- Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation
- A storm of feasibility pumps for nonconvex MINLP
- The supporting hyperplane optimization toolkit for convex MINLP
- Achieving MILP feasibility quickly using general disjunctions
- Recursive central rounding for mixed integer programs
- An exact algorithm for biobjective mixed integer linear programming problems
- MIP formulations and heuristics for two-level production-transportation problems
- Modeling and solving the mixed capacitated general routing problem
- Adaptive large neighborhood search for mixed integer programming
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
- 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
- A variable MIP neighborhood descent algorithm for managing inventory and distribution of cash in automated Teller machines
- MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration
- Redundancy system design for an aircraft door management system
- A disjunctive cut strengthening technique for convex MINLP
- Variable neighborhood search: basics and variants
- Ten years of feasibility pump, and counting
- 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
This page was built for software: FEASPUMP
