Luiz Leduíno de Salles Neto

Orcid: 0000-0001-8938-5370

According to our database1, Luiz Leduíno de Salles Neto authored at least 16 papers between 2005 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Gradual cooperative coverage models for optimally locating rain gauges on an urban transportation network.
Expert Syst. Appl., August, 2023

2022
Unassigned distance geometry and molecular conformation problems.
J. Glob. Optim., 2022

Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost.
J. Comb. Optim., 2022

Optimal rain gauge network to reduce rainfall impacts on urban mobility - a spatial sensitivity analysis.
Ind. Manag. Data Syst., 2022

A sampling-based multi-objective iterative robust optimization method for Bandwidth Packing Problem.
Expert Syst. Appl., 2022

A support tool for planning classrooms considering social distancing between students.
Comput. Appl. Math., 2022

2021
A conjecture on a continuous optimization model for the Golomb Ruler Problem.
RAIRO Oper. Res., 2021

A note on the Cayley-Menger determinant and the Molecular Distance Geometry Problem.
Inf. Sci., 2021

2020
A constrained interval approach to the generalized distance geometry problem.
Optim. Lett., 2020

2018
Solving the 3D stowage planning problem integrated with the quay crane scheduling problem by representation by rules and genetic algorithm.
Appl. Soft Comput., 2018

2016
Pareto clustering search applied for 3D container ship loading plan problem.
Expert Syst. Appl., 2016

2014
Pareto Optimality Conditions and Duality for Vector Quadratic Fractional Optimization Problems.
J. Appl. Math., 2014

Nonidentical circle packing problem: multiple disks installed in a rotating circular container.
CoRR, 2014

2012
INTELCSP: computational intelligence applied to cutting stock problems.
Int. J. Comput. Intell. Stud., 2012

2011
Application of Genetic Algorithm to Minimize the Number of Objects Processed and Setup in a One-Dimensional Cutting Stock Problem.
Int. J. Appl. Evol. Comput., 2011

2005
Nonlinear model to minimize both the number of processed objets and the number of setups in an cutting stock problem.
PhD thesis, 2005


  Loading...