Problem specific variable selection rules for constraint programming: a type II mixed model assembly line balancing problem case

HM Alakaş, B Toklu - Applied Artificial Intelligence, 2020‏ - Taylor & Francis
The main idea of constraint programming (CP) is to determine a solution (or solutions) of a
problem assigning values to decision variables satisfying all constraints. Two sub …

On three soft rectangle packing problems with guillotine constraints

QT Bui, T Vidal, MH Hà - Journal of global optimization, 2019‏ - Springer
We investigate how to partition a rectangular region of length L_1 L 1 and height L_2 L 2
into n rectangles of given areas (a_1,\dots, a_n)(a 1,⋯, an) using two-stage guillotine cuts …

Boosting autonomous search for CSPs via skylines

R Soto, B Crawford, W Palma, K Galleguillos… - Information …, 2015‏ - Elsevier
Solving constraint satisfaction problems via constraint programming involves the exploration
of a search tree where the potential solutions are distributed. The exploration phase is …

A genetic algorithm for fair land allocation

A Gliesch, M Ritt, MCO Moreira - Proceedings of the Genetic and …, 2017‏ - dl.acm.org
The goal of the PROTERRA project of the Brazilian National Institute of Colonization and
Agrarian reform (INCRA) is to establish settlements of multiple families on land which …

Metaheuristic for a soft-rectangle packing problem with guillotine constraints

B Quoc Trung, B Thi-Mai-Anh, N Viet Chinh… - Proceedings of the 12th …, 2023‏ - dl.acm.org
This paper investigates the partitioning of a rectangular region with specified length and
height into n soft rectangles of given areas using two-stage guillotine cuts. The goal is to …

Tolerancia al estrés por sal y cadmio en cuatro genotipos de Medicago sativa L

MCP Insausti, MG Zapico… - AIA avances en …, 2022‏ - revistasacademicas.ucol.mx
Objetivo: Evaluar la tolerancia de cuatro genotipos de Medicago sativa L. a la salinidad y
cadmio, mediante el estudio de la geminación, parámetros de crecimiento, pigmentos …

[PDF][PDF] Modelling and solving complex combinatorial optimization problems: quorumcast routing, elementary shortest path, elementary longest path and agricultural …

QT Bui - 2015‏ - core.ac.uk
The feasible solution set of a Combinatorial Optimization Problem (COP) is discrete and
finite. Solving a COP is to find optimal solutions in the set of feasible solutions such that the …

Salt and Cadmium Stress Tolerance in Four Genotypes of Medicago sativa L.

MC Pacheco Insausti, MG Zapico… - Avances en …, 2022‏ - search.ebscohost.com
Objective: To evaluate the tolerance of four genotypes of Medicago sativa L. to salinity and
cadmium, through the study of germination, growth parameters, photosynthetic pigments …

[PDF][PDF] Salt and Cadmium Stress Tolerance in Four Genotypes of Medicago sativa L.

MCP Insausti, MG Zapico, EA González, E Fernández…‏ - researchgate.net
Objective: To evaluate the tolerance of four genotypes of Medicago sativa L. to salinity and
cadmium, through the study of germination, growth parameters, photosynthetic pigments …

Tolerancia al estrés por sal y cadmio en cuatro genotipos de Medicago sativa L

MC Pacheco Insausti, MG Zapico, EA González… - 2022‏ - ri.conicet.gov.ar
Objective: To evaluate the tolerance of four genotypes of Medicago sativa L. to salinity and
cadmium, through the study of germination, growth parameters, photosynthetic pigments …