- Obecnie brak na stanie
The handbook will be a useful reference to experts in the field as well as students and others who want to learn about discrete optimization.
All of the chapters in this handbook are written by authors who have made significant original contributions to their topics. Herewith a brief introduction to the chapters of the handbook.
"On the history of combinatorial optimization (until 1960)" goes back to work of Monge in the 18th century on the assignment problem and presents six problem areas: assignment, transportation,
maximum flow, shortest tree, shortest path and traveling salesman.
The branch-and-cut algorithm of integer programming is the computational workhorse of discrete optimization. It provides the tools that have been implemented in commercial software such as CPLEX
and Xpress MP that make it possible to solve practical problems in supply chain, manufacturing, telecommunications and many other areas.
"Computational integer programming and cutting planes" presents the key ingredients
of these algorithms.
Although branch-and-cut based on linear programming relaxation is the most widely used integer programming algorithm, other approaches are
needed to solve instances for which branch-and-cut performs poorly and to understand better the structure of integral polyhedra. The next three chapters discuss alternative approaches.
"The structure of group relaxations" studies a family of polyhedra obtained by dropping certain
nonnegativity restrictions on integer programming problems.
Although integer programming is NP-hard in general, it is polynomially solvable in fixed dimension. "Integer programming, lattices, and results in fixed dimension" presents results in this area including algorithms that use reduced bases of integer lattices that are capable of solving certain classes of integer programs that defy solution by branch-and-cut.
Relaxation or dual methods, such as cutting plane algorithms,progressively remove infeasibility while maintaining optimality to the relaxed problem. Such algorithms have the disadvantage of
possibly obtaining feasibility only when the algorithm terminates.Primal methods for integer programs, which move from a feasible solution to a better feasible solution, were studied in the 1960's
but did not appear to be competitive with dual methods. However,recent development in primal methods presented in "Primal integer programming" indicate that this approach is not just interesting theoretically but may have practical implications as well.
The study of matrices that yield integral polyhedra has a long tradition in integer programming. A major breakthrough occurred in the 1990's with the development of polyhedral and structural results
and recognition algorithms for balanced matrices. "Balanced matrices" is a tutorial on the
subject.
Submodular function minimization generalizes some linear combinatorial optimization problems such as minimum cut and is one of the fundamental problems of the field that is solvable in polynomial
time. "Submodular function minimization" presents the theory and algorithms of this subject.
In the search for tighter relaxations of combinatorial optimization problems, semidefinite programming provides a generalization of
linear programming that can give better approximations and is still polynomially solvable. This subject is discussed in "Semidefinite programming and integer programming".
Many real world problems have uncertain data that is known only probabilistically. Stochastic programming treats this topic, but until recently it was limited, for computational reasons, to
stochastic linear programs. Stochastic integer programming is now a high profile research area and recent developments are presented in
"Algorithms for stochastic mixed-integer programming
models".
Resource constrained scheduling is an example of a class of combinatorial optimization problems that is not naturally formulated with linear constraints so that linear programming based methods do
not work well. "Constraint programming" presents an alternative enumerative approach that is complementary to branch-and-cut. Constraint programming,primarily designed for feasibility problems, does not use a relaxation to obtain bounds. Instead nodes of the search tree are
pruned by constraint propagation, which tightens bounds on variables until their values are fixed or their domains are shown to be empty.
1. On the History of Combinatorial Optimization (till 1960) (A. Schrijver). 2. Computational Integer Programming and Cutting Planes (A. Fügenschuh, A. Martin). 3. The Structure of Group Relaxations (R. R. Thomas). 4. Integer programming, lattices, and results in fixed dimension (K. Aardal, F. Eisenbrand). 5. Primal Integer Programming (B. Spille, R. Weismantel). 6. Balanced Matrices (G. Cornuéjols, M. Conforti). 7. Submodular Function Minimization (T. McCormick). 8. Semidefinite Programming and Integer Programming (M. Laurent, F. Rendl). 9. Algorithms for Stochastic Mixed-Integer Programming Models (S. Sen). 10. Constraint Programming (A. Bockmayr, J.N. Hooker).
Moduł WIFI-LPB100-B Eval Kit umożliwia transmisję danych UART przy pomocy sieci WiFi, ultra niski pobór energii, szyfrowana komunikacja
Brak towaru
Płytka ewaluacyjna WIFI501 z modułem WIFI232-B
Brak towaru
Waveshare Mix Board, płytka przejściowa 4 w 1, zawiera czujnik temperatury, odbiornik podczerwieni, joystick i buzzer
Brak towaru
Wyświetlacz alfanumeryczny OLED 4x20, z wbudowanym kontrolerem WS0010, komunikujący się poprzez interfejs 6800, opcjonalnie 8080 lub SPI. Winstar WEH002004AB
Brak towaru
Wyświetlacz alfanumeryczny OLED 4x20, z wbudowanym kontrolerem WS0010, komunikujący się poprzez interfejs 6800, opcjonalnie 8080 lub SPI. Winstar WEH002004AW
Brak towaru
Płytka drukowana do zabezpieczenia - prostej blokady samochodu. AVT3187 A
Brak towaru
Zestaw AVT do samodzielnego montażu zabezpieczenia - prostej blokady samochodu. AVT3187 B
Brak towaru
Płytka drukowana do sterownika odciągu oparów. AVT3215 A
Brak towaru
Zestaw AVT do samodzielnego montażu sterownika odciągu oparów. AVT3215 A
Brak towaru
Zmontowany sterownik odciągu oparów. AVT3215 C
Brak towaru
Brak towaru
Brak towaru
Płytka deweloperska z ośmiordzeniowym układem SoC Samsung Cortex-A53 Octa Core S5P6818 1.4GHz z wbudowaną komunikacją Ethernet, HDMI, interfejsem kamery i wyświetlacza LCD. Płytka zawiera port USB, port szeregowy oraz 40-pinowe złącze GPIO. FriendlyELEC NanoPi Fire3
Brak towaru
NanoPi NEO Core to niewielka płytka wyposażona w układ SoC Allwinner H3 oraz pamieć RAM o pojemności 256 MB. Na port GPIO wyprowadzono m.in. interfejs Ethernet, USB, SPI, UART, I2C, I2S. Płytkę mozna zasilać ze złącza Micro USB. Płytkę można zastosować jako rdzeń większego systemu.
Brak towaru
NanoPi NEO Core2, Allwinner H5 Quad-Core 1,5Ghz + 1GB RAM + 8GB eMMC, bez przylutowanych pinów GPIO
Brak towaru
NanoPi NEO Core to niewielka płytka wyposażona w układ SoC Allwinner H3 oraz pamięć RAM o pojemności 512MB. Na port GPIO wyprowadzono m.in. interfejs Ethernet, USB, SPI, UART, I2C, I2S. Płytkę można zasilać ze złącza Micro USB. FriendlyELEC NanoPi NEO Core LTS
Brak towaru