Sciweavers

14739 search results - page 354 / 2948
» An optimization problem on the sphere
Sort
View
JGAA
2000
179views more  JGAA 2000»
15 years 6 months ago
Approximation Algorithms for Some Graph Partitioning Problems
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
George He, Jiping Liu, Cheng Zhao
4OR
2008
115views more  4OR 2008»
15 years 5 months ago
A branch-and-price algorithm for the two-dimensional level strip packing problem
The two-dimensional level strip packing problem (2LSPP) consists in packing rectangular items of given size into a strip of given width divided into levels. Items packed into the ...
Andrea Bettinelli, Alberto Ceselli, Giovanni Righi...
FAW
2010
Springer
203views Algorithms» more  FAW 2010»
15 years 5 months ago
Online Algorithms for the Newsvendor Problem with and without Censored Demands
The newsvendor problem describes the dilemma of a newspaper salesman—how many papers should he purchase each day to resell, when he doesn’t know the demand? We develop approach...
Peter Sempolinski, Amitabh Chaudhary
MP
2010
145views more  MP 2010»
15 years 5 months ago
The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm
The Traveling Salesman Problem with Pickup and Delivery (TSPPD) is defined on a graph containing pickup and delivery vertices between which there exists a one-toone relationship. ...
Irina Dumitrescu, Stefan Ropke, Jean-Franço...
CDC
2010
IEEE
15 years 1 months ago
Synthesis using approximately bisimilar abstractions: time-optimal control problems
s using Approximately Bisimilar Abstractions: Time-Optimal Control Problems Antoine Girard In this paper, we present a hierarchical approach to time-optimal control using approxima...
Antoine Girard