Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| Programare în Numere Întregi Bazată pe Agenți× | Programarea cu variabile întregi× | |
|---|---|---|
| Domeniu≠ | Simulare | Optimizare |
| Familie | Process / pipeline | Process / pipeline |
| Anul apariției≠ | 1990s–2000s | 1958 |
| Autorul original≠ | Emerged from multi-agent systems and operations research communities | Ralph Gomory (cutting planes, 1958); land-and-doig branch-and-bound (1960) |
| Tip≠ | Hybrid simulation-optimization | Mathematical optimisation — exact combinatorial method |
| Sursa seminală≠ | Wooldridge, M. (2009). An Introduction to MultiAgent Systems (2nd ed.). Wiley. ISBN: 9780470519462 | Wolsey, L.A. (1998). Integer Programming. Wiley. ISBN: 9780471283669 |
| Denumiri alternative≠ | ABIP, Agent-based IP, Multi-agent integer programming, ABM-IP | IP, MIP, mixed-integer programming, mixed-integer linear programming |
| Înrudite≠ | 3 | 4 |
| Rezumat≠ | Agent-Based Integer Programming (ABIP) couples the behavioral richness of agent-based modeling with the combinatorial rigor of integer programming. Individual agents pursue local objectives while a global IP solver enforces discrete feasibility constraints, enabling realistic modeling of multi-actor systems where decisions must be integer-valued — such as resource allocation, scheduling, and network design under emergent interaction effects. | Integer programming (IP), also called mixed-integer programming (MIP) when only some variables are restricted to whole numbers, is a branch of mathematical optimisation in which some or all decision variables must take integer or binary values. Building on linear programming, it was formalised through Ralph Gomory's cutting-plane method (1958) and the Land-and-Doig branch-and-bound algorithm (1960), and it has since become the standard exact framework for scheduling, assignment, routing, and resource-allocation problems. |
| ScholarGateSet de date ↗ |
|
|