Sciweavers

983 search results - page 101 / 197
» Negative-Weight Cycle Algorithms
Sort
View
ANOR
2010
102views more  ANOR 2010»
15 years 1 months ago
Optimal control of dosage decisions in controlled ovarian hyperstimulation
Abstract In the controlled ovary hyperstimulation (COH) cycle of the in vitro fertilization-embryo transfer (IVFET) therapy, the clinicians observe the patients' responses to ...
Miao He, Lei Zhao, Warren B. Powell
DAM
2010
167views more  DAM 2010»
15 years 1 months ago
A new characterization of P6-free graphs
We study P6-free graphs, i.e., graphs that do not contain an induced path on six vertices. Our main result is a new characterization of this graph class: a graph G is P6-free if an...
Pim van 't Hof, Daniël Paulusma
JGT
2008
59views more  JGT 2008»
15 years 26 days ago
Pebbling and optimal pebbling in graphs
Given a distribution of pebbles on the vertices of a graph G, a pebbling move takes two pebbles from one vertex and puts one on a neighboring vertex. The pebbling number (G) is th...
David P. Bunde, Erin W. Chambers, Daniel W. Cranst...
CCE
2004
15 years 23 days ago
Cyclic short-term scheduling of multiproduct batch plants using continuous-time representation
The idea of cyclic scheduling is commonly utilized to address short-term scheduling problems for multiproduct batch plants under the assumption of relatively stable operations and...
Dan Wu, Marianthi G. Ierapetritou
MP
1998
117views more  MP 1998»
15 years 17 days ago
The node capacitated graph partitioning problem: A computational study
In this paper we consider the problem of ^-partitioning the nodes of a graph with capacity restrictions on the sum of the node weights in each subset of the partition, and the obje...
Carlos Eduardo Ferreira, Alexander Martin, C. Carv...