In a recent paper [4] Balas, Ceria and Cornuejoels provided computational results that their Lift-and-Project method [3] successfully solved a series of pure and mixed 0-1 benchmark programs and performed on the average better than several commercial general mixed integer optimization packages existing at the time. The Lift-and-Project approach uses a linear programming formulation derived by i...

Abstract Single-machine scheduling where jobs have a penalty for being late or rejected altogether is an important (sub)problem in manufacturing, logistics, and satellite scheduling. It known to be NP-hard the strong sense, there no polynomial-time algorithm that can guarantee constant-factor approximation (unless P=NP). We provide exact fixed-parameter tractable slack maximum number of time wi...

T paper proposes and tests variants of GRASP (greedy randomized adaptive search procedure) with path relinking for the three-index assignment problem (AP3). GRASP is a multistart metaheuristic for combinatorial optimization. It usually consists of a construction procedure based on a greedy randomized algorithm and of a local search. Path relinking is an intensification strategy that explores tr...

Abstract. This paper describes variants of GRASP (greedy randomized adaptive search procedure) with path relinking for the three index assignment problem (AP3). GRASP is a multi-start metaheuristic for combinatorial optimization. It usually consists of a construction procedure based on a greedy randomized algorithm and of a local search. Path relinking is an intensification strategy that explor...

This essay aims to reflect on the impacts of state violence upon black lives and childhoods. In wanderings through city Rio de Janeiro in theoretical trails proposed by antiracist decolonial thinkers, we discuss challenges racism formative existential itineraries racialized bodies, crossed public necropolitics that provides premises pedagogical government peripheral childhoods adolescences larg...