Results 11 to 20 of about 2,808,443 (278)
Revisiting lagrange relaxation (LR) for processing large-scale mixed integer programming (MIP) problems [PDF]
, 2004 Lagrangean Relaxation has been successfully applied to process many well known instances of NP-hard Mixed Integer Programming problems. In this paper we present a Lagrangean Relaxation based generic solver for processing Mixed Integer Programming ...
Siamitros, C, Mitra, G, Poojari, CA
core +5 more sources
Non-convex mixed-integer nonlinear programming : a survey [PDF]
, 2012 A wide range of problems arising in practical applications can be formulated as Mixed-Integer Nonlinear Programs (MINLPs). For the case in which the objective and constraint functions are convex, some quite effective exact and heuristic algorithms are ...
Burer, S +3 more
core +4 more sources
Cutting plane methods for general integer programming [PDF]
, 1993 Integer programming (IP) problems are difficult to solve due to the integer restrictions imposed on them. A technique for solving these problems is the cutting plane method.
Mitra, G +5 more
core +6 more sources
A fuzzy mixed integer programming for marketing planning [PDF]
Management Science Letters, 2014 One of the primary concerns to market a product is to find appropriate channel to target customers. The recent advances on information technology have created new products with tremendous opportunities.
Abolfazl Danaei +2 more
doaj +1 more source
A new interactive approach for solving fully fuzzy mixed integer linear programming [PDF]
Yugoslav Journal of Operations Research, 2020 In this paper, a novel method to solve Fully Fuzzy Mixed Integer Linear Programming (FFMILP) problems is presented. Our method is based on the definition of membership function and a fuzzy interactive technique for solving the classical multiobjective ...
Khalili Goudarzi Farzaneh +2 more
doaj +1 more source
Mixed-integer programming in motion planning
Annual Reviews in Control, 2021 This paper presents a review of past and present results and approaches in the area of motion planning using MIP (Mixed-integer Programming). Although in the early 2000s MIP was still seen with reluctance as method for solving motion planning-related problems, nowadays, due to increases in computational power and theoretical advances, its extensive ...
Ioan, Daniel +4 more
openaire +3 more sources
New variants of variable neighbourhood search for 0-1 mixed integer programming and clustering [PDF]
, 2010 This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.Many real-world optimisation problems are discrete in nature.
Lazić, Jasmina
core +7 more sources
Automatic instantiation of a Variable Neighborhood Descent from a Mixed Integer Programming model
Operations Research Perspectives, 2017 In this paper we describe the automatic instantiation of a Variable Neighborhood Descent procedure from a Mixed Integer Programming model. We extend a recent approach in which a single neighborhood structure is automatically designed from a Mixed Integer
Tommaso Adamo +3 more
doaj +1 more source
Adaptive Cut Selection in Mixed-Integer Linear Programming
Open Journal of Mathematical Optimization, 2023 Cutting plane selection is a subroutine used in all modern mixed-integer linear programming solvers with the goal of selecting a subset of generated cuts that induce optimal solver performance.
Turner, Mark +3 more
doaj +1 more source
A dual heuristic for mixed integer programming [PDF]
Operations Research Letters, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yaxian Li +2 more
openaire +1 more source