FEASPUMP

swMATH4802MaRDI QIDQ16964FDOQ16964

Author name not available (Why is that?)

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

• 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
• 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
• Repairing MIP infeasibility through local branching
• Two-step MIR inequalities for mixed integer programs
• FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming
• 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
• Modeling and solving a bi-objective airport slot scheduling problem
• Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
• 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
• Continuous reformulations for zero-one programming problems
• Improving Benders decomposition using a genetic algorithm
• A feasibility pump for mixed integer nonlinear programs
• On the strength of Gomory mixed-integer cuts as group cuts
• Feasibility pump 2.0
• Integer-programming software systems
• Generation of feasible integer solutions on a massively parallel computer using the feasibility pump
• Variable neighbourhood pump heuristic for 0-1 mixed integer programming feasibility
• 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
• The supporting hyperplane optimization toolkit for convex 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
• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
• An interior point cutting plane heuristic for mixed integer programming
• A recipe for finding good solutions to MINLPs
• An empirical evaluation of walk-and-round heuristics for mixed integer linear programs
• A feasibility pump heuristic for general mixed-integer problems
• Improving the feasibility pump
• Fix-and-relax approaches for controlled tabular adjustment
• The feasibility pump
• A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times
• RENS. The optimal rounding
• Faster integer-feasibility in mixed-integer linear programs by branching to force change
• A new class of functions for measuring solution integrality in the feasibility pump approach
• Inexact feasibility pump for mixed integer nonlinear programming
• Static analysis by abstract interpretation: a mathematical programming approach
• Algorithms and Software for Convex Mixed Integer Nonlinear Programs
• ZI round, a MIP rounding heuristic
• Active-constraint variable ordering for faster feasibility of mixed integer linear programs
• Decomposition, reformulation, and diving in university course timetabling
• SCIP: solving constraint integer programs
• Solving hard mixed-integer programming problems with Xpress-MP: a MIPLIB 2003 case study
• Boosting the feasibility pump
• Point-to-point shortest paths on dynamic time-dependent road networks
• A heuristic approach for big bucket multi-level production planning problems
• Irreducible infeasible sets in convex mixed-integer programs
• A relax-and-cut framework for Gomory mixed-integer cuts
• Combinatorial integral approximation
• Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization
• Cut generation for an integrated employee timetabling and production scheduling problem
• 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
• Mixed integer nonlinear programming tools: an updated practical overview
• A New Approach to the Feasibility Pump in Mixed Integer Programming
• Inexact solution of NLP subproblems in MINLP
• Shift-and-propagate
• Undercover: a primal MINLP heuristic exploring a largest sub-MIP
• Feasibility Pump-like heuristics for mixed integer problems
• Convex analysis in groups and semigroups: a sampler
• On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems
• Generalized relax-and-fix heuristic
• Mathematical programming based heuristics for the 0--1 MIP: a survey
• Performance criteria for optimization of cardiac assistance
• A feasible rounding approach for mixed-integer optimization 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
• The search-and-remove algorithm for biobjective mixed-integer linear programming problems
• A partial outer convexification approach to control transmission lines
• A computational study of parametric tabu search for 0-1 mixed integer programs
• An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs
• Four Good Reasons to Use an Interior Point Solver Within a MIP Solver
• Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT
• A simple effective heuristic for embedded mixed-integer quadratic programming
• A multi-item approach to repairable stocking and expediting in a fluctuating demand environment
• 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
• Coupling feasibility pump and large neighborhood search to solve the Steiner team orienteering problem
• Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation
• Adaptive large neighborhood search for mixed integer programming

This page was built for software: FEASPUMP