Search
Code Directory
 ASP
 ASP.NET
 C/C++
 CFML
 CGI/PERL
 Delphi
 Development
 Flash
 HTML
 Java
 JavaScript
 Pascal
 PHP
 Python
 SQL
 Tools
 Visual Basic & VB.NET
 XML
New Code
Rapid PHP 2018 15.5
IBDAC 6.4
Online Course Booking Script 1.3.3
Database Workbench Pro 5.6.4
Job Portal Script 1.3.2
The C# PDF Library 5.2
PostgreSQL Data Access Components 6.0
Virtual Data Access Components 11.0
HTMLPad 2018 15.5
WeBuilder 2018 15.5
SentiMask SDK Trial 2.0.0
Track Order For Magento 2 1.0.0
Calendar 365 For Dynamics CRM 4.0
Scimbo 1.2
Odoo Furnito Theme 1.0
Top Code
TdsPrinter 1.8
Top Rated
VisualNEO Web 2018.12.15
Azizi search engine script PHP 4.1.10
Paste phpSoftPro 1.4.1
Extreme Injector 3.7
Deals and Discounts Website Script 1.0.2
ADO.NET Provider for ExactTarget 1.0
Solid File System OS edition 5.1
Classified Ad Lister 1.0
Aglowsoft SQL Query Tools 8.2
Invoice Manager by PHPJabbers 3.0
ICPennyBid Penny Auction Script 4.0
PHP Review Script 1.0
ATN Resume Finder 2.0
ATN Site Builder 3.0
Availability Booking Calendar PHP 1.0
Wagner-Whitin Algorithm 1.0
File ID: 79719






Wagner-Whitin Algorithm 1.0
Download Wagner-Whitin Algorithm 1.0http://www.mathworks.comReport Error Link
License: Shareware
File Size: 10.0 KB
Downloads: 85
User Rating:3 Stars  (2 ratings)
Submit Rating:
Wagner-Whitin Algorithm 1.0 Description
Description: Build production plans versus time cycles k =1,...,N responding production queries dk
and miniming the sum of following production costs

i) Fix production cost K_k
ii) Unitary production cost c_k
iii) Stockage unitary cost h_k

Assumption : initial and final stocks are null.

License: Shareware

Related: unitary, stockage, assumption, initial, Stocks, final, costs, versus, plans, Production, cycles, responding, miniming, Queries, Build

O/S:BSD, Linux, Solaris, Mac OS X

File Size: 10.0 KB

Downloads: 85



More Similar Code

An implementation of "A min cut algorithm" by Stoer and Wagner.
In addition there is an option to find the minimal cut that does not separate a set of vertices.

This is not a mincut-maxflow algorithm.

Updated version.



A Minimum Cut Solver

This python script is for solving the ACM problem Q2914: Minimum Cut.
http://acm.pku.edu.cn/JudgeOnline/problem?id=2914

Instead of using Ford-Fulkerson method, I use Stoer and Wagner's Min cut...



This is an evolutionary algorithm that returns a random list of prime numbers. This code is highly inefficient for a reason. This algorithm is more of a proof of concept that if a prime was a heritable trait, it would not be a desired one.



This is a pure Python implementation of the rsync algorithm. On my desktop (3.0GHz dual core, 7200RPM), best case throughput for target file hash generation and delta generation is around 2.9MB/s. Absolute worst case scenario (no blocks in common)...



A-star (A*) Shortest Path Algorithm



Dijkstra shortest path algorithm.



Floyd-Steinberg dithering is an image dithering algorithm (see http://en.wikipedia.org/wiki/Floyd-Steinberg for more details). While the algorithm is mainly for image manipulation, I use it to create random locations for sensor networt devices.



This is a simple implementation of the famous LZW algorithm.



this algorithm predicts the received signal strength for the mobile user to avoid fluctuation in received signal strength during localization of the mobile user(finding mobile user's location)



NSGA-II is a very famous multi-objective optimization algorithm. I submitted an example previously and wanted to make this submission useful to others by creating it as a function. Even though this function is very specific to benchmark problems,...

User Review for Wagner-Whitin Algorithm
- required fields
     

Please enter text on the image