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)
- 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
- Repairing MIP infeasibility through local branching
- 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
- 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
- Performance criteria for optimization of cardiac assistance
- A feasible rounding approach for mixed-integer optimization problems
- Continuous reformulations for zero-one programming problems
- A computational study of parametric tabu search for 0-1 mixed integer programs
- On the strength of Gomory mixed-integer cuts as group cuts
- 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
- 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
- A proximal-point outer approximation algorithm
- Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation
- The supporting hyperplane optimization toolkit for convex MINLP
- 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
- Restrict-and-relax search for 0-1 mixed-integer programs
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- A recipe for finding good solutions to MINLPs
- Penalty alternating direction methods for mixed-integer optimization: a new view on feasibility pumps
- Fix-and-relax approaches for controlled tabular adjustment
- 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
- Inexact feasibility pump for mixed integer nonlinear programming
- Static analysis by abstract interpretation: a mathematical programming approach
- ZI round, a MIP rounding heuristic
- Active-constraint variable ordering for faster feasibility of mixed integer linear programs
- Solving hard mixed-integer programming problems with Xpress-MP: a MIPLIB 2003 case study
- Three ideas for a feasibility pump for nonconvex MINLP
- 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
- Combinatorial integral approximation
- MindtPy
- Cut generation for an integrated employee timetabling and production scheduling problem
- Integer Programming
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- Mixed integer nonlinear programming tools: an updated practical overview
- Inexact solution of NLP subproblems in MINLP
- Shift-and-propagate
- Undercover: a primal MINLP heuristic exploring a largest sub-MIP
- 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
This page was built for software: FEASPUMP
