Pubbl/distr/stampa	Washington, D.C., : IOS Press, 2011
Descrizione fisica	1 online resource (240 p.)
Disciplina	519.64 658.5
Altri autori (Persone)	ChvátalVašek
Collana	NATO science for peace and security series. Sub-series D, Information and communication security
Soggetto topico	Combinatorial optimization
ISBN	6613289620 1-283-28962-8 9786613289629 1-60750-718-8
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	Title; Preface; Acknowledgments; The NATO Advanced Study Institute; Contents; Mixed Integer Rounding Cuts and Master Group Polyhedra; Combinatorial Optimization in VLSI Design; Facility Location: Discrete Models and Local Search Methods; Discrete Convexity and Its Applications; Branching on Split Disjunctions; Convex Discrete Optimization
Record Nr.	UNINA-9910806201503321

Pubbl/distr/stampa	London, : ISTE, 2010
Descrizione fisica	1 online resource (722 p.)
Disciplina	519.64
Altri autori (Persone)	PaschosVangelis Th
Collana	ISTE
Soggetto topico	Combinatorial optimization Programming (Mathematics)
Soggetto genere / forma	Electronic books.
ISBN	1-118-60020-7 1-118-60027-4
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	pt. I. Paradigmatic problems -- pt. II. New approaches.
Record Nr.	UNINA-9910141601103321

Pubbl/distr/stampa	New York [etc.], : Wiley, 1998
Descrizione fisica	X, 355 p. ; 24 cm
Disciplina	519.6 519.64
Collana	Wiley interscience series in discrete mathematics and optimization
Soggetto topico	Ottimizzazione
ISBN	047155894X
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Titolo uniforme
Record Nr.	UNISANNIO-TO00636188

Edizione	[1st ed. 2018.]
Pubbl/distr/stampa	Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018
Descrizione fisica	1 online resource (XIII, 756 p. 179 illus., 96 illus. in color.)
Disciplina	519.64
Collana	Theoretical Computer Science and General Issues
Soggetto topico	Algorithms Computer science—Mathematics Discrete mathematics Numerical analysis Artificial intelligence—Data processing Computer engineering Computer networks Discrete Mathematics in Computer Science Numerical Analysis Mathematical Applications in Computer Science Data Science Computer Engineering and Networks
ISBN	3-030-04651-6
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	Graph Theory -- Network Flow and Security -- Combinatorial Optimization -- Computational Geometry -- Combinatorial Optimization -- Combinatorial Optimization and Data Structure -- Clustering.
Record Nr.	UNISA-996466292003316

Pubbl/distr/stampa	London, : ISTE
Descrizione fisica	1 online resource (518 p.)
Disciplina	519.6/4 519.64
Altri autori (Persone)	PaschosVangelis Th
Collana	ISTE
Soggetto topico	Combinatorial optimization - Computer programs Computer science - Mathematics
Soggetto genere / forma	Electronic books.
ISBN	1-282-16499-6 9786612164996 0-470-61109-X 0-470-39367-X
Classificazione	SK 890 ST 130
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	Combinatorial Optimization and Theoretical Computer Science; Contents; Preface; Chapter 1. The Complexity of Single Machine Scheduling Problems under Scenario-based Uncertainty; 1.1. Introduction; 1.2. Problem MinMax(1\|prec\|fmax, θ ); 1.2.1. Uncertainty on due dates; 1.2.2. Uncertainty on processing times and due dates; 1.3. Problem MinMax(1\|\| Σ wj Cj, Wj ); 1.4. Problem MinMax(1\|\| Σ Uj, θ ); 1.4.1. Uncertainty on due dates; 1.4.2. Uncertainty on processing times; 1.5. Bibliography; Chapter 2. Approximation of Multi-criteria Min and Max TSP(1, 2); 2.1. Introduction 2.1.1. The traveling salesman problem2.1.2. Multi-criteria optimization; 2.1.3. Organization of the chapter; 2.2. Overview; 2.3. The bicriteria TSP(1, 2); 2.3.1. Simple examples of the non-approximability; 2.3.2. A local search heuristic for the bicriteria TSP(1, 2); 2.3.3. A nearest neighbor heuristic for the bicriteria TSP(1, 2); 2.3.4. On the bicriteria Max TSP(1, 2); 2.4. k-criteria TSP(1, 2); 2.4.1. Non-approximability related to the number of generated solutions; 2.4.2. A nearest neighbor heuristic for the k-criteria TSP(1, 2); 2.5. Conclusion; 2.6. Bibliography Chapter 3. Online Models for Set-covering: The Flaw of Greediness3.1. Introduction; 3.2. Description of the main results and related work; 3.3. The price of ignorance; 3.4. Competitiveness of TAKE-ALL and TAKE-AT-RANDOM; 3.4.1. TAKE-ALL algorithm; 3.4.2. TAKE-AT-RANDOM algorithm; 3.5. The nasty flaw of greediness; 3.6. The power of look-ahead; 3.7. The maximum budget saving problem; 3.8. Discussion; 3.9. Bibliography; Chapter 4. Comparison of Expressiveness for Timed Automata and Time Petri Nets; 4.1. Introduction; 4.2. Time Petri nets and timed automata 4.2.1. Timed transition systems and equivalence relations4.2.2. Time Petri nets; 4.2.3. Timed automata; 4.2.4. Expressiveness and equivalence problems; 4.3. Comparison of semantics I, A and PA; 4.3.1. A first comparison between the different semantics of TPNs; 4.3.2. A second comparison for standard bounded TPN; 4.4. Strict ordering results; 4.5. Equivalence with respect to timed language acceptance; 4.5.1. Encoding atomic constraints; 4.5.2. Resetting clocks; 4.5.3. The complete construction; 4.5.4. Δ (A) and A accept the same timed language; 4.5.5. Consequences of the previous results 4.6. Bisimulation of TA by TPNs4.6.1. Regions of a timed automaton; 4.6.2. From bisimulation to uniform bisimulation; 4.6.3. A characterization of bisimilarity; 4.6.4. Proof of necessity; 4.6.5. First construction; 4.6.6. Second construction; 4.6.7. Complexity results; 4.7. Conclusion; 4.8. Bibliography; Chapter 5. A "Maximum Node Clustering" Problem; 5.1. Introduction; 5.2. Approximation algorithm for the general problem; 5.3. The tree case; 5.3.1. Dynamic programming; 5.3.2. A fully polynomial time approximation scheme; 5.4. Exponential algorithms for special cases; 5.5. Bibliography Chapter 6. The Patrolling Problem: Theoretical and Experimental Results
Record Nr.	UNINA-9910139491403321