Results 1 to 10 of about 27,242,528 (312)
A polyhedral approach to the generalized minimum labeling spanning tree problem
The minimum labeling spanning tree problem (MLSTP) is a combinatorial optimization problem that consists in finding a spanning tree in a simple graph G, in which each edge has one label, by using a minimum number of labels.
ThiagoGouveiada Silva +4 more
doaj +2 more sources
Chemical Looping Combustion (CLC) is a technology that allows the separation of CO2, which is generated by the combustion of fossil fuels. The majority of process designs currently under investigation are systems of coupled fluidized beds.
Sosnowski Marcin +2 more
doaj +2 more sources
Polyhedral complementarity problem with quasimonotone decreasing mappings [PDF]
The fixed point problem of piecewise constant mappings in Rn is investigated. This is a polyhedral complementarity problem, which is a generalization of the linear complementarity problem.
Shmyrev Vadim I.
doaj +1 more source
A Polyhedral Approach to Bisubmodular Function Minimization [PDF]
We consider minimization problems with bisubmodular objective functions. We propose valid inequalities, namely the poly-bimatroid inequalities, and provide a complete linear description of the convex hull of the epigraph of a bisubmodular function ...
Qi-Meng Yu, Simge Küçükyavuz
semanticscholar +1 more source
CFD-DEM Simulation of Fluidization of Polyhedral Particles in a Fluidized Bed
Fluidization of non-spherical particles is a common process in energy industries and chemical engineering. Understanding the fluidization of non-spherical particles is important to guide relevant processes.
Zihan Liu, Huaqing Ma, Yongzhi Zhao
doaj +1 more source
The design of handling equipment for granular biomass primarily requires experiments. Discrete element models (DEM) can provide designers with detailed insight into the behaviour of granular materials.
Yi-Dong Xia +7 more
semanticscholar +1 more source
On the Graovac-Pisanski index [PDF]
The Graovac-Pisanski index (GP index) is an algebraic approach for generalizing the Wiener index. In this paper, we compute the difference between the Wiener and GP indices for an infinite family of polyhedral graphs.
Hakimi-Nezhaad Mardjan +1 more
doaj +1 more source
AUTOMATIC 3D RECONSTRUCTION OF COMPLEX BUILDINGS FROM INCOMPLETE POINT CLOUDS WITH TOPOLOGICAL-RELATION CONSTRAINTS [PDF]
Automatic 3D building reconstruction from laser scanning or photogrammetric point clouds has gained increasing attention in the past two decades. Although many efforts have been made, the complexity of buildings and incompletion of point clouds, i.e ...
Y. Li, B. Wu
doaj +1 more source
This paper focuses on the competencies in environmental health acquired by students during compulsory education. Questionnaires addressing environmental health problems were completed by 923 students of primary and secondary schools from five different ...
J. Montero-Pau +3 more
semanticscholar +1 more source
The number of corner polyhedra graphs [PDF]
Corner polyhedra were introduced by Eppstein and Mumford (2014) as the set of simply connected 3D polyhedra such that all vertices have non negative integer coordinates, edges are parallel to the coordinate axes and all vertices but one can be seen from ...
Clement Dervieux +2 more
doaj +1 more source

