Sciweavers

154 search results - page 18 / 31
» Approximated Consistency for Knapsack Constraints
Sort
View
EOR
2010
107views more  EOR 2010»
13 years 8 months ago
An optimization-based heuristic for the robotic cell problem
This study investigates an optimization-based heuristic for the Robotic Cell Problem. This problem arises in automated cells and is a complex ow shop problem with a single transpo...
Jacques Carlier, Mohamed Haouari, Mohamed Kharbech...
CORR
2011
Springer
220views Education» more  CORR 2011»
13 years 3 months ago
On a linear programming approach to the discrete Willmore boundary value problem and generalizations
We consider the problem of finding (possibly non connected) discrete surfaces spanning a finite set of discrete boundary curves in the three-dimensional space and minimizing (glo...
Thomas Schoenemann, Simon Masnou, Daniel Cremers
ICIP
2006
IEEE
14 years 10 months ago
Variational Unsupervised Segmentation of Multi-Look Complex Polarimetric Images using a Wishart Observation Model
We address unsupervised variational segmentation ofmulti-look complex polarimetric images using a Wishart observation model via level sets. The methods consists of minimizing a fu...
Ismail Ben Ayed, Amar Mitiche, Ziad Belhadj
CDC
2009
IEEE
121views Control Systems» more  CDC 2009»
14 years 1 months ago
Piecewise-linear constrained control for timed continuous Petri nets
— Timed Continuous Petri Net (TCPN) systems are piecewise linear models with input constraints that can approximate the dynamical behavior of a class of timed discrete event syst...
Carlos Renato Vázquez, Manuel Silva
EOR
2008
80views more  EOR 2008»
13 years 8 months ago
An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem
The car sequencing problem consists in sequencing a given set of cars to be produced in a single day. We address one of the variants of this problem, in which the objective of mini...
Celso C. Ribeiro, Daniel Aloise, Thiago F. Noronha...