Handbook of combinatorial optimization. 1Dingzhu Du, Panos M. Pardalos Springer Science & Business Media, 1998 - 2403 lappuses The first of a multi-volume set, which deals with several algorithmic approaches for discrete problems as well as many combinatorial problems. It is addressed to researchers in discrete optimization, and to all scientists who use combinatorial optimization methods to model and solve problems. |
No grāmatas satura
1.–5. rezultāts no 51.
8. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
42. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
86. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
89. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
90. lappuse
Atvainojiet, šīs lappuses saturs ir ierobežots..
Atvainojiet, šīs lappuses saturs ir ierobežots..
Saturs
Approximate Algorithms and Heuristics for MAXSAT | 77 |
Connections between Nonlinear Programming | 149 |
Interior Point Methods for Combinatorial Optimization | 189 |
Knapsack Problems | 299 |
Fractional Combinatorial Optimization | 429 |
ReformulationLinearization Techniques | 479 |
Gröbner Bases in Integer Programming | 533 |
Applications of Set Covering Set Packing | 573 |
747 | |
773 | |
Citi izdevumi - Skatīt visu
Handbook of Combinatorial Optimization Panos M. Pardalos,Ding-Zhu Du,Ronald L. Graham Priekšskatījums nav pieejams - 2013 |
Bieži izmantoti vārdi un frāzes
0-1 Knapsack Problem applications approach approximation arcs binary variables branching clauses combinatorial optimization Computer consider constraints convex hull corresponding Crew Scheduling cutting plane defined denote Discrete dual dynamic programming edge feasible solution formulation fractional combinatorial optimization given Global Optimization graph greedy Gröbner basis Heuristic inequalities instances integer programming interior point method Journal of Operational Knapsack Problem Lemma linear programming Location Problem lower bound LP relaxation Management Science Martello and Toth master problem Mathematical Programming matrix maximize maximum minimal minimum MINLP Newton method node nonlinear number of iterations objective function obtained Operations Research optimal solution Pardalos performance ratio polynomial polytope prob programming problems quadratic recursion relaxation Routing Problem satisfied Scheduling Problem Section semidefinite programming Set Covering Set Covering Problem Sherali solved subproblem subset Subset-sum techniques Theorem tion truth assignment upper bound Vehicle Routing vertex weight zero-one