Results 81 to 90 of about 8,069,229 (248)

Investigating the Low‐Temperature Phase Stability of the Binary Ta–W System

Advanced Engineering Materials, EarlyView.
Atomistic simulations show that the binary Ta–W system forms ordered intermetallic phases, B2‐TaW and D03‐TaW3, as 0 K ground states. Configurational entropy, however, lowers the free energy of the disordered bcc solid solution, which becomes the stable phase above about 400 K.
Klemens Lechner, Anna Sophie Jelinek, Velislava Terziyska, Peter Wagatha, Wolfram Knabl, Christian Mitterer, Helmut Clemens, David Holec   +7 more
wiley   +1 more source

A polynomial time equivalence between DNA sequencing and the exact perfect matching problem

, 2007
We investigate the computational complexity of a combinatorial problem that arises in DNA sequencing by hybridization: The input consists of an integer l together with a set S of words of length k over the four symbols A, C, G, T.
Formanowicz, P., Kasprzak, M., Blazewicz, J., Woeginger, G.J., Schuurman, P.   +4 more
core   +1 more source

Combinatorial optimization model for railway engine assignment problem [PDF]

, 2006
This paper presents an experimental study for the Hungarian State Railway Company (M\'AV). The engine assignment problem was solved at M\'AV by their experts without using any explicit operations research tool.
Makai, M., Illés, T., Vaik, Zsuzsanna
core   +2 more sources

Enhancement of the Through‐Thickness Electrical Conductivity of Carbon‐Fiber‐Reinforced Plastics Using Large Graphite Particles

Advanced Engineering Materials, EarlyView.
To enhance through‐thickness conductivity without sacrificing impregnation, large spherical graphite particles are intentionally employed in a low‐viscosity resin. Unlike finer conductive fillers, these particles remain outside the fiber bundles and accumulate in resin‐rich interlaminar regions during molding.
Keito Hosoe, Yu Zhou, Shintaro Kamiyama, Takao Okada, Tomohiro Yokozeki, Ryoma Tokonami, Tatsuhiro Takahashi   +6 more
wiley   +1 more source

A hybrid genetic - GRASP algorithm using lagrangean relaxation for the traveling salesman problem

, 2005
Summarization: Hybridization techniques are very effective for the solution of combinatorial optimization problems. This paper presents a genetic algorithm based on Expanding Neighborhood Search technique (Marinakis, Migdalas, and Pardalos, Computational
Marinakis Ioannis(http://users.isc.tuc.gr/~imarinakis), Μαρινακης Ιωαννης(http://users.isc.tuc.gr/~imarinakis), Migdalas, Athanasios(http://viaf.org/viaf/61832297), Pardalos, P. M(http://viaf.org/viaf/108896172), Athanasios Migdalas, Pardalos, Panos M.,, Marinakis, Yannis,, Yannis Marinakis, Panos M. Pardalos, Migdalas, Athanasios,   +9 more
core   +1 more source

Approximating Incremental Combinatorial Optimization Problems [PDF]

, 2017
We consider incremental combinatorial optimization problems, in which a solution is constructed incrementally over time, and the goal is to optimize not the value of the final solution but the average value over all timesteps.
Unda, Francisco, Goemans, Michel X.
core   +1 more source

An Integer Linear Programming Formulation for the Minimum Cardinality Segmentation Problem

Algorithms, 2015
In this article, we investigate the Minimum Cardinality Segmentation Problem (MCSP), an NP-hard combinatorial optimization problem arising in intensity-modulated radiation therapy.
Daniele Catanzaro, Céline Engelbeen
doaj   +1 more source

Elastic–Plastic Modeling and Experimental Characterization of Granular Jamming Actuators

Advanced Engineering Materials, EarlyView.
Granular jamming enables rapid switching between soft and rigid mechanical states. Here, a reduced‐order elastic‐perfectly‐plastic beam framework captures pressure‐dependent loading, unloading, residual deformation, and hysteresis in jammed beams, while matching three‐point bending experiments across materials and geometries. The framework links design
Saheli Patel, Prashant K. Purohit, Jordan R. Raney   +2 more
wiley   +1 more source

TSP - Infrastructure for the Traveling Salesperson Problem [PDF]

, 2007
The traveling salesperson or salesman problem (TSP) is a well known and important combinatorial optimization problem. The goal is to find the shortest tour that visits each city in a given list exactly once and then returns to the starting city.
Kurt Hornik, Michael Hahsler, Hahsler, Michael, Hornik, Kurt, Manrique Salas, Elsa Milena   +4 more
core   +1 more source

Polynomially searchable exponential neighbourhoods for sequencing problems in combinatorial optimisation

, 2000
In this thesis, we study neighbourhoods of exponential size that can be searched in polynomial time. Such neighbourhoods are used in local search algorithms for classes of combinatorial optimisation problems.
Congram, Richard K., Congram, R.K.
core   +1 more source