Results 11 to 20 of about 27,242,528 (312)

A polyhedral approach for the equitable coloring problem [PDF]

Discrete Applied Mathematics, 2011
In this work we study the polytope associated with a 0,1-integer programming formulation for the Equitable Coloring Problem. We find several families of valid inequalities and derive sufficient conditions in order to be facet-defining inequalities.
I. Méndez-Díaz, G. Nasini, Daniel E. Severín   +2 more
semanticscholar   +4 more sources

A Polyhedral Approach to the Multi-Layer Crossing Minimization Problem [PDF]

International Symposium Graph Drawing and Network Visualization, 1997
We study the multi-layer crossing minimization problem from a polyhedral point of view. After the introduction of an integer programming formulation of the multi-layer crossing minimization problem, we examine the 2-layer case and derive several classes ...
M. Jünger, Eva K. Lee, Petra Mutzel, T. Odenthal   +3 more
semanticscholar   +7 more sources

Data‐Driven Modeling of Composition–Processing–Microstructure Relations for Recycled Aluminum Cast Alloys [PDF]

Advanced Science, EarlyView.
Interpretable machine learning reveals how composition and processing govern the formation and microstructural burden of Fe‐rich intermetallic compounds in recycled Al–Si–Fe–Mn alloys. By separating morphology selection from morphology‐conditioned burden partitioning, this framework shows that identical Fe contents can yield different intermetallic ...
Jaemin Wang, Waleed Mohammed, Dierk Raabe   +2 more
wiley   +2 more sources

Dimple‐Encoded Reprogrammable Origami [PDF]

Advanced Science, EarlyView.
Local snap‐through of bistable dimples turns flat elastic sheets into reprogrammable origami structures. Interaction‐guided dimple arrays act as angle‐programmable hinge bands, enabling one sheet to morph into distinct polygonal and three‐dimensional configurations while retaining stable shapes for deployable and protective functions.
Qun Zhang, Weicheng Huang, Amir Hajiyavand, Hyunyoung Kim, Claire Dancer, Karl Dearn, Mingchao Liu   +6 more
wiley   +2 more sources

A polyhedral approach to the rural postman problem

European Journal of Operational Research, 1994
In this paper we study the polyhedron associated with the Rural Postman Problem (RPP). Because the RPP is NP-hard, we cannot expect to find a complete description of the rural postman polyhedron of a general graph, but a partial knowledge of such a ...
Á. Corberán, J. Sanchis
semanticscholar   +3 more sources

Cache-efficient and vectorized parallel dynamic programming for RNA folding. [PDF]

PLoS ONE
In this article, we present an efficient and concise OpenMP implementation of the Nussinov RNA folding algorithm, a well-known representative of non-serial polyadic dynamic programming (NPDP).
Mateusz Gruzewski, Marek Palkowski
doaj   +2 more sources

Potential‐Controlled Ammonium‐Assisted Reversible Electrodeposition of Polyoxometalates for Hybrid Redox Flow Batteries [PDF]

Advanced Science, EarlyView.
Potential‐controlled NH4+‐assisted reversible electrodeposition of molecular metal oxide clusters enables dynamic solution‐to‐solid electron storage. Leveraging this deposition/dissolution reaction chemistry, polyoxometalate‐based hybrid flow batteries are demonstrated as a new platform for deposition‐based electrochemical energy storage.
Ke Wang, Nikhil Arya, Sadia Shahid, Montaha Anjass   +3 more
wiley   +2 more sources

DEM calibration insights on the role of particle shape for sub 2 mm particles [PDF]

Scientific Reports
This study introduces a comprehensive calibration technique for discrete element method (DEM) simulations. Its focus is on particles smaller than 2 mm and this showcase shows comparison between spherical and polyhedral particle shape calibration.
Jan Diviš, David Žurovec, Álvaro Ramírez-Gómez, Jakub Hlosta, Jiří Rozbroj, Kamila Pokorná, Jan Nečas, Jiří Zegzulka   +7 more
doaj   +2 more sources

A polyhedral approach to the alldifferent system

Mathematical Programming, 2012
This paper examines the facial structure of the convex hull of integer vectors satisfying a system of alldifferent predicates, also called an alldifferent system. The underlying analysis is based on a property, called inclusion, pertinent to such a system.
D. Magos, I. Mourtos, Gautam M. Appa
semanticscholar   +2 more sources

A polyhedral approach to edge coloring [PDF]

Operations Research Letters, 1991
The edge coloring problem is formulated as an integer linear program of covering edges by matchings. For the NP-hard case of 3-regular graphs a linear programming relaxation with additional constraints is considered using column generation. The theory and the algorithm use the fact that the chromatic index is equal to 3 or 4.
G. Nemhauser, Sungsoo Park
semanticscholar   +5 more sources